Base | Representation |
---|---|
bin | 1001000110011011110110… |
… | …01110110011110110011111 |
3 | 2121212011021222221001011100 |
4 | 10203031323032303312133 |
5 | 10110340212422041111 |
6 | 110321311040524143 |
7 | 4133561643161562 |
oct | 443157316636637 |
9 | 77764258831140 |
10 | 20012320112031 |
11 | 64161a4a8a605 |
12 | 22b2631620653 |
13 | b221cc868760 |
14 | 4d285c5a64d9 |
15 | 24a876789756 |
hex | 12337b3b3d9f |
20012320112031 has 24 divisors (see below), whose sum is σ = 31328557769600. Its totient is φ = 12236832668736.
The previous prime is 20012320112003. The next prime is 20012320112033. The reversal of 20012320112031 is 13021102321002.
20012320112031 is a `hidden beast` number, since 200 + 1 + 2 + 320 + 112 + 0 + 31 = 666.
It is not a de Polignac number, because 20012320112031 - 238 = 19737442205087 is a prime.
It is a super-2 number, since 2×200123201120312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20012320111995 and 20012320112013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20012320112033) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 544712431 + ... + 544749168.
Almost surely, 220012320112031 is an apocalyptic number.
20012320112031 is a deficient number, since it is larger than the sum of its proper divisors (11316237657569).
20012320112031 is a wasteful number, since it uses less digits than its factorization.
20012320112031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1089461775 (or 1089461772 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 20012320112031 its reverse (13021102321002), we get a palindrome (33033422433033).
The spelling of 20012320112031 in words is "twenty trillion, twelve billion, three hundred twenty million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •