Base | Representation |
---|---|
bin | 10111000000101001111100… |
… | …000101000001110011000101 |
3 | 111021022122011001022010111120 |
4 | 113000221330011001303011 |
5 | 101231030301341334341 |
6 | 555122403514424153 |
7 | 30213315563310324 |
oct | 2700517405016305 |
9 | 437278131263446 |
10 | 101200101121221 |
11 | 2a2777a3890123 |
12 | b425311132059 |
13 | 446118967789b |
14 | 1adc17a9400bb |
15 | ba76a82d2066 |
hex | 5c0a7c141cc5 |
101200101121221 has 32 divisors (see below), whose sum is σ = 136403955770112. Its totient is φ = 66733943377920.
The previous prime is 101200101121159. The next prime is 101200101121303. The reversal of 101200101121221 is 122121101002101.
It is a happy number.
It is not a de Polignac number, because 101200101121221 - 29 = 101200101120709 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101200101121221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101200101123221) 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, 1925650681 + ... + 1925703233.
It is an arithmetic number, because the mean of its divisors is an integer number (4262623617816).
Almost surely, 2101200101121221 is an apocalyptic number.
It is an amenable number.
101200101121221 is a deficient number, since it is larger than the sum of its proper divisors (35203854648891).
101200101121221 is a wasteful number, since it uses less digits than its factorization.
101200101121221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64093.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101200101121221 its reverse (122121101002101), we get a palindrome (223321202123322).
The spelling of 101200101121221 in words is "one hundred one trillion, two hundred billion, one hundred one million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •