Base | Representation |
---|---|
bin | 10110101111011000011101… |
… | …010111110010100010000011 |
3 | 111010010011021222120222111021 |
4 | 112233120131113302202003 |
5 | 101102103312403331321 |
6 | 552413215011330311 |
7 | 30031464611564551 |
oct | 2657303527624203 |
9 | 433104258528437 |
10 | 100013101230211 |
11 | 2995a355343364 |
12 | b2732612b0997 |
13 | 43a626c49c380 |
14 | 1a9a934bacbd1 |
15 | b86884a6a941 |
hex | 5af61d5f2883 |
100013101230211 has 8 divisors (see below), whose sum is σ = 113375175483920. Its totient is φ = 87460849658592.
The previous prime is 100013101230191. The next prime is 100013101230247. The reversal of 100013101230211 is 112032101310001.
It is a happy number.
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 100013101230211 - 27 = 100013101230083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100013101230281) 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, 202455670260 + ... + 202455670753.
It is an arithmetic number, because the mean of its divisors is an integer number (14171896935490).
Almost surely, 2100013101230211 is an apocalyptic number.
100013101230211 is a deficient number, since it is larger than the sum of its proper divisors (13362074253709).
100013101230211 is a wasteful number, since it uses less digits than its factorization.
100013101230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404911341045.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 100013101230211 its reverse (112032101310001), we get a palindrome (212045202540212).
The spelling of 100013101230211 in words is "one hundred trillion, thirteen billion, one hundred one million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •