Base | Representation |
---|---|
bin | 10110111110000100000101… |
… | …101100000010100010000001 |
3 | 111020200121111100111211011210 |
4 | 112332010011230002202001 |
5 | 101220121044411400001 |
6 | 554504513104000333 |
7 | 30164412601044456 |
oct | 2676040554024201 |
9 | 436617440454153 |
10 | 101022021200001 |
11 | 2a209220368610 |
12 | b3b68b26000a9 |
13 | 444a449777135 |
14 | 1ad36c5b5782d |
15 | ba2c34450dd6 |
hex | 5be105b02881 |
101022021200001 has 32 divisors (see below), whose sum is σ = 150988188653568. Its totient is φ = 59555173199040.
The previous prime is 101022021199999. The next prime is 101022021200011. The reversal of 101022021200001 is 100002120220101.
It is not a de Polignac number, because 101022021200001 - 21 = 101022021199999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101022021200001.
It is not an unprimeable number, because it can be changed into a prime (101022021200011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 199543126 + ... + 200048751.
It is an arithmetic number, because the mean of its divisors is an integer number (4718380895424).
Almost surely, 2101022021200001 is an apocalyptic number.
101022021200001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101022021200001 is a deficient number, since it is larger than the sum of its proper divisors (49966167453567).
101022021200001 is a wasteful number, since it uses less digits than its factorization.
101022021200001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 399592101.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101022021200001 its reverse (100002120220101), we get a palindrome (201024141420102).
The spelling of 101022021200001 in words is "one hundred one trillion, twenty-two billion, twenty-one million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •