Base | Representation |
---|---|
bin | 10110111110000100010001… |
… | …100011001010100001000001 |
3 | 111020200122000012222001212011 |
4 | 112332010101203022201001 |
5 | 101220122001332400001 |
6 | 554504544533132521 |
7 | 30164420535365422 |
oct | 2676042143124101 |
9 | 436618005861764 |
10 | 101022220200001 |
11 | 2a209312728221 |
12 | b3b694918a141 |
13 | 444a47ba71209 |
14 | 1ad3704359649 |
15 | ba2c46b5dd51 |
hex | 5be1118ca841 |
101022220200001 has 16 divisors (see below), whose sum is σ = 105608568597120. Its totient is φ = 96569996826240.
The previous prime is 101022220199911. The next prime is 101022220200037. The reversal of 101022220200001 is 100002022220101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101022220200001 - 221 = 101022218102849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101022220600001) 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 15 ways as a sum of consecutive naturals, for example, 164872770 + ... + 165484363.
It is an arithmetic number, because the mean of its divisors is an integer number (6600535537320).
Almost surely, 2101022220200001 is an apocalyptic number.
It is an amenable number.
101022220200001 is a deficient number, since it is larger than the sum of its proper divisors (4586348397119).
101022220200001 is an equidigital number, since it uses as much as digits as its factorization.
101022220200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330357336.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 101022220200001 its reverse (100002022220101), we get a palindrome (201024242420102).
The spelling of 101022220200001 in words is "one hundred one trillion, twenty-two billion, two hundred twenty million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •