Base | Representation |
---|---|
bin | 10111000000110100000110… |
… | …010111010010110101110110 |
3 | 111021100200022101100110212111 |
4 | 113000310012113102311312 |
5 | 101231220122320200042 |
6 | 555131410245241234 |
7 | 30214153130511565 |
oct | 2700640627226566 |
9 | 437320271313774 |
10 | 101211011100022 |
11 | 2a28139222272a |
12 | b427456a0321a |
13 | 4462207a43745 |
14 | 1adc8d3899bdc |
15 | ba7ae5edd517 |
hex | 5c0d065d2d76 |
101211011100022 has 32 divisors (see below), whose sum is σ = 161017636237920. Its totient is φ = 47628608536320.
The previous prime is 101211011099909. The next prime is 101211011100047. The reversal of 101211011100022 is 220001110112101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101211011099975 and 101211011100011.
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 in 15 ways as a sum of consecutive naturals, for example, 15105453 + ... + 20750824.
It is an arithmetic number, because the mean of its divisors is an integer number (5031801132435).
Almost surely, 2101211011100022 is an apocalyptic number.
101211011100022 is a deficient number, since it is larger than the sum of its proper divisors (59806625137898).
101211011100022 is a wasteful number, since it uses less digits than its factorization.
101211011100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35857536.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101211011100022 its reverse (220001110112101), we get a palindrome (321212121212123).
The spelling of 101211011100022 in words is "one hundred one trillion, two hundred eleven billion, eleven million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •