Base | Representation |
---|---|
bin | 10111000000101001110110… |
… | …110001000110101001010000 |
3 | 111021022121220211121220210012 |
4 | 113000221312301012221100 |
5 | 101231030111033341422 |
6 | 555122351012454052 |
7 | 30213313432015106 |
oct | 2700516661065120 |
9 | 437277824556705 |
10 | 101200012012112 |
11 | 2a277758558132 |
12 | b4252a731a328 |
13 | 44611740782c0 |
14 | 1adc16cb85c76 |
15 | ba76a057e4e2 |
hex | 5c0a76c46a50 |
101200012012112 has 80 divisors (see below), whose sum is σ = 211408040009040. Its totient is φ = 46652338077696.
The previous prime is 101200012012079. The next prime is 101200012012147. The reversal of 101200012012112 is 211210210002101.
It can be written as a sum of positive squares in 8 ways, for example, as 10102455406096 + 91097556606016 = 3178436^2 + 9544504^2 .
It is a super-2 number, since 2×1012000120121122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2221565528 + ... + 2221611080.
It is an arithmetic number, because the mean of its divisors is an integer number (2642600500113).
Almost surely, 2101200012012112 is an apocalyptic number.
It is an amenable number.
101200012012112 is an abundant number, since it is smaller than the sum of its proper divisors (110208027996928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101200012012112 is a wasteful number, since it uses less digits than its factorization.
101200012012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58000 (or 57994 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101200012012112 its reverse (211210210002101), we get a palindrome (312410222014213).
The spelling of 101200012012112 in words is "one hundred one trillion, two hundred billion, twelve million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •