Base | Representation |
---|---|
bin | 10111000000101001110111… |
… | …111101101111011001111011 |
3 | 111021022121222020102120221112 |
4 | 113000221313331233121323 |
5 | 101231030131204231021 |
6 | 555122353011230535 |
7 | 30213314064540203 |
oct | 2700516775573173 |
9 | 437277866376845 |
10 | 101200032102011 |
11 | 2a277768929a57 |
12 | b4252b1ba844b |
13 | 446117829060b |
14 | 1adc1716d5403 |
15 | ba76a21ebd5b |
hex | 5c0a77f6f67b |
101200032102011 has 8 divisors (see below), whose sum is σ = 104645597030784. Its totient is φ = 97765782658560.
The previous prime is 101200032101999. The next prime is 101200032102077. The reversal of 101200032102011 is 110201230002101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101200032102011 - 26 = 101200032101947 is a prime.
It is a super-2 number, since 2×1012000321020112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101200032102811) 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, 2828853140 + ... + 2828888913.
It is an arithmetic number, because the mean of its divisors is an integer number (13080699628848).
Almost surely, 2101200032102011 is an apocalyptic number.
101200032102011 is a deficient number, since it is larger than the sum of its proper divisors (3445564928773).
101200032102011 is an equidigital number, since it uses as much as digits as its factorization.
101200032102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5657742661.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 101200032102011 its reverse (110201230002101), we get a palindrome (211401262104112).
The spelling of 101200032102011 in words is "one hundred one trillion, two hundred billion, thirty-two million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •