Base | Representation |
---|---|
bin | 111101111111101… |
… | …011111001100111 |
3 | 2200111010210220202 |
4 | 331333223321213 |
5 | 4112231330223 |
6 | 251113021115 |
7 | 34526514164 |
oct | 7577537147 |
9 | 2614123822 |
10 | 1040105063 |
11 | 494126368 |
12 | 2503b479b |
13 | 13763c7aa |
14 | 9c1cb06b |
15 | 614a4428 |
hex | 3dfebe67 |
1040105063 has 4 divisors (see below), whose sum is σ = 1046993328. Its totient is φ = 1033216800.
The previous prime is 1040104991. The next prime is 1040105093. The reversal of 1040105063 is 3605010401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3605010401 = 11239 ⋅320759.
It is a cyclic number.
It is not a de Polignac number, because 1040105063 - 212 = 1040100967 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040105093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3443906 + ... + 3444207.
It is an arithmetic number, because the mean of its divisors is an integer number (261748332).
Almost surely, 21040105063 is an apocalyptic number.
1040105063 is a deficient number, since it is larger than the sum of its proper divisors (6888265).
1040105063 is an equidigital number, since it uses as much as digits as its factorization.
1040105063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6888264.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 1040105063 is about 32250.6598847217. The cubic root of 1040105063 is about 1013.1935198401.
Adding to 1040105063 its reverse (3605010401), we get a palindrome (4645115464).
The spelling of 1040105063 in words is "one billion, forty million, one hundred five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •