Base | Representation |
---|---|
bin | 110000000010110101100110… |
… | …001011010011010011011111 |
3 | 1000201011012101100102102112012 |
4 | 300002311212023103103133 |
5 | 210143424344344044444 |
6 | 2025222235053301435 |
7 | 62336003135020454 |
oct | 6002654613232337 |
9 | 1021135340372465 |
10 | 211301220299999 |
11 | 6136638727aa55 |
12 | 1b84771319487b |
13 | 90b9809292b2b |
14 | 3a270683d382b |
15 | 196666a102b9e |
hex | c02d662d34df |
211301220299999 has 8 divisors (see below), whose sum is σ = 213417871494960. Its totient is φ = 209185050672000.
The previous prime is 211301220299903. The next prime is 211301220300097. The reversal of 211301220299999 is 999992022103112.
211301220299999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 211301220299999 - 240 = 210201708672223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211301220209999) 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, 119509757 + ... + 121264934.
It is an arithmetic number, because the mean of its divisors is an integer number (26677233936870).
Almost surely, 2211301220299999 is an apocalyptic number.
211301220299999 is a deficient number, since it is larger than the sum of its proper divisors (2116651194961).
211301220299999 is a wasteful number, since it uses less digits than its factorization.
211301220299999 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 240783481.
The product of its (nonzero) digits is 2834352, while the sum is 59.
The spelling of 211301220299999 in words is "two hundred eleven trillion, three hundred one billion, two hundred twenty million, two hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •