Base | Representation |
---|---|
bin | 10111000000101001110111… |
… | …001111100111110010101001 |
3 | 111021022121221101200100211210 |
4 | 113000221313033213302221 |
5 | 101231030120110342301 |
6 | 555122351500143333 |
7 | 30213313560015015 |
oct | 2700516717476251 |
9 | 437277841610753 |
10 | 101200020012201 |
11 | 2a277762021780 |
12 | b4252a9b37b49 |
13 | 4461175919796 |
14 | 1adc16dc69545 |
15 | ba76a110ead6 |
hex | 5c0a773e7ca9 |
101200020012201 has 16 divisors (see below), whose sum is σ = 147394480966848. Its totient is φ = 61252323854400.
The previous prime is 101200020012137. The next prime is 101200020012211. The reversal of 101200020012201 is 102210020002101.
It is not a de Polignac number, because 101200020012201 - 26 = 101200020012137 is a prime.
It is a super-4 number, since 4×1012000200122014 (a number of 57 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (101200020012211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2025514830 + ... + 2025564791.
It is an arithmetic number, because the mean of its divisors is an integer number (9212155060428).
Almost surely, 2101200020012201 is an apocalyptic number.
101200020012201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101200020012201 is a deficient number, since it is larger than the sum of its proper divisors (46194460954647).
101200020012201 is a wasteful number, since it uses less digits than its factorization.
101200020012201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4051080392.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101200020012201 its reverse (102210020002101), we get a palindrome (203410040014302).
The spelling of 101200020012201 in words is "one hundred one trillion, two hundred billion, twenty million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •