Base | Representation |
---|---|
bin | 101111000101010101… |
… | …1111011110111010100 |
3 | 100122222121020001120002 |
4 | 1132022223323313110 |
5 | 3124033410133022 |
6 | 114241052030432 |
7 | 10206424332551 |
oct | 1361253736724 |
9 | 318877201502 |
10 | 101111021012 |
11 | 39976598691 |
12 | 17719a62418 |
13 | 96c4a4b921 |
14 | 4c7282ba28 |
15 | 296ba4b092 |
hex | 178aafbdd4 |
101111021012 has 6 divisors (see below), whose sum is σ = 176944286778. Its totient is φ = 50555510504.
The previous prime is 101111020973. The next prime is 101111021029. The reversal of 101111021012 is 210120111101.
It can be written as a sum of positive squares in only one way, i.e., 65145415696 + 35965605316 = 255236^2 + 189646^2 .
It is a junction number, because it is equal to n+sod(n) for n = 101111020984 and 101111021002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12638877623 + ... + 12638877630.
It is an arithmetic number, because the mean of its divisors is an integer number (29490714463).
Almost surely, 2101111021012 is an apocalyptic number.
It is an amenable number.
101111021012 is a deficient number, since it is larger than the sum of its proper divisors (75833265766).
101111021012 is a wasteful number, since it uses less digits than its factorization.
101111021012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25277755257 (or 25277755255 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101111021012 its reverse (210120111101), we get a palindrome (311231132113).
The spelling of 101111021012 in words is "one hundred one billion, one hundred eleven million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •