Base | Representation |
---|---|
bin | 10111000000101001111100… |
… | …101011001101011000001001 |
3 | 111021022122011202010122010120 |
4 | 113000221330223031120021 |
5 | 101231030311422130441 |
6 | 555122404513133453 |
7 | 30213316044344643 |
oct | 2700517453153011 |
9 | 437278152118116 |
10 | 101200111130121 |
11 | 2a2777a94a6a43 |
12 | b42531455a289 |
13 | 446118b770503 |
14 | 1adc17bdc7893 |
15 | ba76a910c966 |
hex | 5c0a7cacd609 |
101200111130121 has 8 divisors (see below), whose sum is σ = 135963508083744. Its totient is φ = 66951727464960.
The previous prime is 101200111130101. The next prime is 101200111130147. The reversal of 101200111130121 is 121031111002101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101200111130121 - 29 = 101200111129609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101200111130121.
It is not an unprimeable number, because it can be changed into a prime (101200111130101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128753321656 + ... + 128753322441.
It is an arithmetic number, because the mean of its divisors is an integer number (16995438510468).
Almost surely, 2101200111130121 is an apocalyptic number.
It is an amenable number.
101200111130121 is a deficient number, since it is larger than the sum of its proper divisors (34763396953623).
101200111130121 is a wasteful number, since it uses less digits than its factorization.
101200111130121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257506644231.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 101200111130121 its reverse (121031111002101), we get a palindrome (222231222132222).
The spelling of 101200111130121 in words is "one hundred one trillion, two hundred billion, one hundred eleven million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •