Base | Representation |
---|---|
bin | 10110101111001110011001… |
… | …101000001011101000010011 |
3 | 111010002010102022001110011202 |
4 | 112233032121220023220103 |
5 | 101101414203024001321 |
6 | 552404231201101415 |
7 | 30030633146260541 |
oct | 2657163150135023 |
9 | 433063368043152 |
10 | 100002301000211 |
11 | 29955812950745 |
12 | b27114832786b |
13 | 43a523aa7b42c |
14 | 1a9a1cc660d91 |
15 | b864517dc70b |
hex | 5af399a0ba13 |
100002301000211 has 8 divisors (see below), whose sum is σ = 100054901766144. Its totient is φ = 99949704237000.
The previous prime is 100002301000157. The next prime is 100002301000229. The reversal of 100002301000211 is 112000103200001.
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 100002301000211 - 222 = 100002296805907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100002301000192 and 100002301000201.
It is not an unprimeable number, because it can be changed into a prime (100002301000291) 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, 49653086 + ... + 51627836.
It is an arithmetic number, because the mean of its divisors is an integer number (12506862720768).
Almost surely, 2100002301000211 is an apocalyptic number.
100002301000211 is a deficient number, since it is larger than the sum of its proper divisors (52600765933).
100002301000211 is a wasteful number, since it uses less digits than its factorization.
100002301000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2001361.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 100002301000211 its reverse (112000103200001), we get a palindrome (212002404200212).
The spelling of 100002301000211 in words is "one hundred trillion, two billion, three hundred one million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •