Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …000111101000011011111 |
3 | 10220011022122202121221022 |
4 | 100000131300331003133 |
5 | 121010310304000111 |
6 | 2201201005154355 |
7 | 142321204140416 |
oct | 20003560750337 |
9 | 3804278677838 |
10 | 1100011000031 |
11 | 39456a594529 |
12 | 15923355b9bb |
13 | 7c96615a078 |
14 | 3b352b2c47d |
15 | 1d9319252db |
hex | 1001dc3d0df |
1100011000031 has 2 divisors, whose sum is σ = 1100011000032. Its totient is φ = 1100011000030.
The previous prime is 1100011000027. The next prime is 1100011000063. The reversal of 1100011000031 is 1300001100011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1100011000031 - 22 = 1100011000027 is a prime.
It is a super-2 number, since 2×11000110000312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100010999982 and 1100011000018.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100011000091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550005500015 + 550005500016.
It is an arithmetic number, because the mean of its divisors is an integer number (550005500016).
Almost surely, 21100011000031 is an apocalyptic number.
1100011000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100011000031 is an equidigital number, since it uses as much as digits as its factorization.
1100011000031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 1100011000031 its reverse (1300001100011), we get a palindrome (2400012100042).
The spelling of 1100011000031 in words is "one trillion, one hundred billion, eleven million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •