Base | Representation |
---|---|
bin | 1001001001100111001111… |
… | …00110011000111110011100 |
3 | 2122020121010210111202200110 |
4 | 10210303213212120332130 |
5 | 10114132324134241012 |
6 | 110443410054530020 |
7 | 4144505556350562 |
oct | 444634746307634 |
9 | 78217123452613 |
10 | 20121512415132 |
11 | 6458538212017 |
12 | 230b825966910 |
13 | b2c5b19192ab |
14 | 4d7c5a3b9a32 |
15 | 24d6179d973c |
hex | 124ce7998f9c |
20121512415132 has 24 divisors (see below), whose sum is σ = 47836048384656. Its totient is φ = 6580620412288.
The previous prime is 20121512415089. The next prime is 20121512415143. The reversal of 20121512415132 is 23151421512102.
It is a super-2 number, since 2×201215124151322 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20121512415132.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15818798433 + ... + 15818799704.
It is an arithmetic number, because the mean of its divisors is an integer number (1993168682694).
Almost surely, 220121512415132 is an apocalyptic number.
It is an amenable number.
20121512415132 is an abundant number, since it is smaller than the sum of its proper divisors (27714535969524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20121512415132 is a wasteful number, since it uses less digits than its factorization.
20121512415132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31637598197 (or 31637598195 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 20121512415132 its reverse (23151421512102), we get a palindrome (43272933927234).
The spelling of 20121512415132 in words is "twenty trillion, one hundred twenty-one billion, five hundred twelve million, four hundred fifteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.935 sec. • engine limits •