Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110001111010101110110010 |
3 | 111020122120001021101102220022 |
4 | 112331321310301322232302 |
5 | 101214431012012010002 |
6 | 554455451323443442 |
7 | 30163542514242653 |
oct | 2675716461725662 |
9 | 436576037342808 |
10 | 101011000110002 |
11 | 2a204585235574 |
12 | b3b4737686582 |
13 | 44493b13771c8 |
14 | 1ad2d5c15752a |
15 | ba27dbae7ba2 |
hex | 5bde74c7abb2 |
101011000110002 has 64 divisors (see below), whose sum is σ = 159450277472640. Its totient is φ = 47952500649984.
The previous prime is 101011000109969. The next prime is 101011000110043. The reversal of 101011000110002 is 200011000110101.
It is a happy number.
101011000110002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1010110001100022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 119129498 + ... + 119974410.
It is an arithmetic number, because the mean of its divisors is an integer number (2491410585510).
Almost surely, 2101011000110002 is an apocalyptic number.
101011000110002 is a deficient number, since it is larger than the sum of its proper divisors (58439277362638).
101011000110002 is a wasteful number, since it uses less digits than its factorization.
101011000110002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845307.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 101011000110002 its reverse (200011000110101), we get a palindrome (301022000220103).
Subtracting 101011000110002 from its reverse (200011000110101), we obtain a palindrome (99000000000099).
The spelling of 101011000110002 in words is "one hundred one trillion, eleven billion, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •