Base | Representation |
---|---|
bin | 10000000000111000101… |
… | …110000100100011010011 |
3 | 10220012111011201020122112 |
4 | 100000320232010203103 |
5 | 121012222041313024 |
6 | 2201313522055535 |
7 | 142335335052551 |
oct | 20007056044323 |
9 | 3805434636575 |
10 | 1100463229139 |
11 | 39478189299a |
12 | 15933aaaa5ab |
13 | 7ca08a57561 |
14 | 3b396c0abd1 |
15 | 1d95b4a400e |
hex | 10038b848d3 |
1100463229139 has 2 divisors, whose sum is σ = 1100463229140. Its totient is φ = 1100463229138.
The previous prime is 1100463229123. The next prime is 1100463229181. The reversal of 1100463229139 is 9319223640011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1100463229139 - 24 = 1100463229123 is a prime.
It is a super-2 number, since 2×11004632291392 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100463229096 and 1100463229105.
It is not a weakly prime, because it can be changed into another prime (1100463229199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550231614569 + 550231614570.
It is an arithmetic number, because the mean of its divisors is an integer number (550231614570).
Almost surely, 21100463229139 is an apocalyptic number.
1100463229139 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100463229139 is an equidigital number, since it uses as much as digits as its factorization.
1100463229139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 41.
The spelling of 1100463229139 in words is "one trillion, one hundred billion, four hundred sixty-three million, two hundred twenty-nine thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •