Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1101000100011011101111 |
3 | 1102222122120111021012112202 |
4 | 2200032320231010123233 |
5 | 2420401213100031111 |
6 | 35230232435052115 |
7 | 2214345215510303 |
oct | 240167055043357 |
9 | 42878514235482 |
10 | 11011100002031 |
11 | 356586598a808 |
12 | 129a03714103b |
13 | 61b45ac930ac |
14 | 2a0d23837d03 |
15 | 141655dedb3b |
hex | a03b8b446ef |
11011100002031 has 2 divisors, whose sum is σ = 11011100002032. Its totient is φ = 11011100002030.
The previous prime is 11011100001997. The next prime is 11011100002171. The reversal of 11011100002031 is 13020000111011.
It is a happy number.
11011100002031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11011100002031 - 222 = 11011095807727 is a prime.
It is a super-3 number, since 3×110111000020313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011100002531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505550001015 + 5505550001016.
It is an arithmetic number, because the mean of its divisors is an integer number (5505550001016).
Almost surely, 211011100002031 is an apocalyptic number.
11011100002031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011100002031 is an equidigital number, since it uses as much as digits as its factorization.
11011100002031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11011100002031 its reverse (13020000111011), we get a palindrome (24031100113042).
The spelling of 11011100002031 in words is "eleven trillion, eleven billion, one hundred million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •