Base | Representation |
---|---|
bin | 10111000000101010000010… |
… | …100101001000100110111101 |
3 | 111021022122102122112221212011 |
4 | 113000222002211020212331 |
5 | 101231031012302413041 |
6 | 555122422412411221 |
7 | 30213321356420251 |
oct | 2700520245104675 |
9 | 437278378487764 |
10 | 101200210201021 |
11 | 2a27784a413418 |
12 | b425341776b11 |
13 | 44611a614a149 |
14 | 1adc18b216261 |
15 | ba76b2b7be81 |
hex | 5c0a829489bd |
101200210201021 has 64 divisors (see below), whose sum is σ = 107213100422400. Its totient is φ = 95428797235200.
The previous prime is 101200210201009. The next prime is 101200210201049. The reversal of 101200210201021 is 120102012002101.
It is a cyclic number.
It is not a de Polignac number, because 101200210201021 - 25 = 101200210200989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101200210200992 and 101200210201010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101200210201001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 37301955961 + ... + 37301958673.
It is an arithmetic number, because the mean of its divisors is an integer number (1675204694100).
Almost surely, 2101200210201021 is an apocalyptic number.
It is an amenable number.
101200210201021 is a deficient number, since it is larger than the sum of its proper divisors (6012890221379).
101200210201021 is a wasteful number, since it uses less digits than its factorization.
101200210201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3950.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101200210201021 its reverse (120102012002101), we get a palindrome (221302222203122).
The spelling of 101200210201021 in words is "one hundred one trillion, two hundred billion, two hundred ten million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •