Base | Representation |
---|---|
bin | 10110111110000100001011… |
… | …000011000100001001010001 |
3 | 111020200121201121201022222020 |
4 | 112332010023003010021101 |
5 | 101220121240421401001 |
6 | 554504530035202053 |
7 | 30164415042263646 |
oct | 2676041303041121 |
9 | 436617647638866 |
10 | 101022111122001 |
11 | 2a2092670a6313 |
12 | b3b6918746329 |
13 | 444a46229c714 |
14 | 1ad36d3a83dcd |
15 | ba2c3c2b4736 |
hex | 5be10b0c4251 |
101022111122001 has 8 divisors (see below), whose sum is σ = 134698628104320. Its totient is φ = 67346834110512.
The previous prime is 101022111121979. The next prime is 101022111122027. The reversal of 101022111122001 is 100221111220101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101022111122001 - 29 = 101022111121489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101022111122081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 309802590 + ... + 310128503.
It is an arithmetic number, because the mean of its divisors is an integer number (16837328513040).
Almost surely, 2101022111122001 is an apocalyptic number.
It is an amenable number.
101022111122001 is a deficient number, since it is larger than the sum of its proper divisors (33676516982319).
101022111122001 is an equidigital number, since it uses as much as digits as its factorization.
101022111122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619985415.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101022111122001 its reverse (100221111220101), we get a palindrome (201243222342102).
The spelling of 101022111122001 in words is "one hundred one trillion, twenty-two billion, one hundred eleven million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •