Base | Representation |
---|---|
bin | 10110111111001101101010… |
… | …011100110100011000001100 |
3 | 111020222011101222210120100011 |
4 | 112333031222130310120030 |
5 | 101222414342401320022 |
6 | 555005100134243004 |
7 | 30203210360223124 |
oct | 2677155234643014 |
9 | 436864358716304 |
10 | 101101021120012 |
11 | 2a23977a7a6801 |
12 | b40a07b4b6464 |
13 | 4454a29644534 |
14 | 1ad745bb63c84 |
15 | ba4d09c24977 |
hex | 5bf36a73460c |
101101021120012 has 12 divisors (see below), whose sum is σ = 176931454616280. Its totient is φ = 50549176943936.
The previous prime is 101101021119961. The next prime is 101101021120067. The reversal of 101101021120012 is 210021120101101.
It is a happy number.
It is a super-2 number, since 2×1011010211200122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101101021119974 and 101101021120001.
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, 333233437 + ... + 333536692.
It is an arithmetic number, because the mean of its divisors is an integer number (14744287884690).
Almost surely, 2101101021120012 is an apocalyptic number.
It is an amenable number.
101101021120012 is a deficient number, since it is larger than the sum of its proper divisors (75830433496268).
101101021120012 is a wasteful number, since it uses less digits than its factorization.
101101021120012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666808040 (or 666808038 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101101021120012 its reverse (210021120101101), we get a palindrome (311122141221113).
The spelling of 101101021120012 in words is "one hundred one trillion, one hundred one billion, twenty-one million, one hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •