Base | Representation |
---|---|
bin | 10111000000111101100101… |
… | …101011010000001001111011 |
3 | 111021101122121110202101222112 |
4 | 113000331211223100021323 |
5 | 101231402004211231021 |
6 | 555140213303042535 |
7 | 30214663461554003 |
oct | 2700754553201173 |
9 | 437348543671875 |
10 | 101221200102011 |
11 | 2a285740698730 |
12 | b42941b14044b |
13 | 446316c9372c2 |
14 | 1add1bcb7b003 |
15 | ba7ee0781d5b |
hex | 5c0f65ad027b |
101221200102011 has 8 divisors (see below), whose sum is σ = 110433645000000. Its totient is φ = 92010508140040.
The previous prime is 101221200101963. The next prime is 101221200102013. The reversal of 101221200102011 is 110201002122101.
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 101221200102011 - 234 = 101204020232827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101221200102013) 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, 438113261 + ... + 438344238.
It is an arithmetic number, because the mean of its divisors is an integer number (13804205625000).
Almost surely, 2101221200102011 is an apocalyptic number.
101221200102011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101221200102011 is a deficient number, since it is larger than the sum of its proper divisors (9212444897989).
101221200102011 is a wasteful number, since it uses less digits than its factorization.
101221200102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876468009.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101221200102011 its reverse (110201002122101), we get a palindrome (211422202224112).
The spelling of 101221200102011 in words is "one hundred one trillion, two hundred twenty-one billion, two hundred million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •