Base | Representation |
---|---|
bin | 10110111110000011001000… |
… | …111000101010111100101110 |
3 | 111020200111212021000102120002 |
4 | 112332003020320222330232 |
5 | 101220112002240213402 |
6 | 554504223543424302 |
7 | 30164345403253265 |
oct | 2676031070527456 |
9 | 436614767012502 |
10 | 101021001101102 |
11 | 2a208847567175 |
12 | b3b6668a55092 |
13 | 444a316320814 |
14 | 1ad362a4975dc |
15 | ba2bc4aee602 |
hex | 5be0c8e2af2e |
101021001101102 has 64 divisors (see below), whose sum is σ = 154717267622400. Its totient is φ = 49461112681344.
The previous prime is 101021001101087. The next prime is 101021001101147. The reversal of 101021001101102 is 201101100120101.
It is a super-2 number, since 2×1010210011011022 (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 31 ways as a sum of consecutive naturals, for example, 23808859793 + ... + 23808864035.
It is an arithmetic number, because the mean of its divisors is an integer number (2417457306600).
Almost surely, 2101021001101102 is an apocalyptic number.
101021001101102 is a deficient number, since it is larger than the sum of its proper divisors (53696266521298).
101021001101102 is a wasteful number, since it uses less digits than its factorization.
101021001101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6537.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101021001101102 its reverse (201101100120101), we get a palindrome (302122101221203).
The spelling of 101021001101102 in words is "one hundred one trillion, twenty-one billion, one million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •