Base | Representation |
---|---|
bin | 10010101110110001… |
… | …010011100100111100 |
3 | 1220220122022222112110 |
4 | 102232301103210330 |
5 | 312142134430022 |
6 | 13123410334020 |
7 | 1311252302004 |
oct | 225661234474 |
9 | 56818288473 |
10 | 20112030012 |
11 | 8590797908 |
12 | 3a9358a310 |
13 | 1b86970c99 |
14 | d8b129004 |
15 | 7ca9ea00c |
hex | 4aec5393c |
20112030012 has 12 divisors (see below), whose sum is σ = 46928070056. Its totient is φ = 6704010000.
The previous prime is 20112029999. The next prime is 20112030041. The reversal of 20112030012 is 21003021102.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 1676002501 = 20112030012 / (2 + 0 + 1 + 1 + 2 + 0 + 3 + 0 + 0 + 1 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 20112030012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 838001239 + ... + 838001262.
Almost surely, 220112030012 is an apocalyptic number.
It is an amenable number.
20112030012 is an abundant number, since it is smaller than the sum of its proper divisors (26816040044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112030012 is a wasteful number, since it uses less digits than its factorization.
20112030012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1676002508 (or 1676002506 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 20112030012 its reverse (21003021102), we get a palindrome (41115051114).
It can be divided in two parts, 201120 and 30012, that added together give a palindrome (231132).
The spelling of 20112030012 in words is "twenty billion, one hundred twelve million, thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •