Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …001110000010011111100011 |
3 | 111010002000001210022201100012 |
4 | 112233031030032002133203 |
5 | 101101404023042121121 |
6 | 552403454245315135 |
7 | 30030556026436631 |
oct | 2657151416023743 |
9 | 433060053281305 |
10 | 100001002301411 |
11 | 29955206862052 |
12 | b270a45405aab |
13 | 43a50919aa7c3 |
14 | 1a9a107d9c351 |
15 | b863c77a7c5b |
hex | 5af34c3827e3 |
100001002301411 has 8 divisors (see below), whose sum is σ = 105883503549120. Its totient is φ = 94118510981248.
The previous prime is 100001002301353. The next prime is 100001002301467. The reversal of 100001002301411 is 114103200100001.
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 100001002301411 - 210 = 100001002300387 is a prime.
It is a super-2 number, since 2×1000010023014112 (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 (100001002321411) 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, 31735505 + ... + 34743981.
It is an arithmetic number, because the mean of its divisors is an integer number (13235437943640).
Almost surely, 2100001002301411 is an apocalyptic number.
100001002301411 is a deficient number, since it is larger than the sum of its proper divisors (5882501247709).
100001002301411 is a wasteful number, since it uses less digits than its factorization.
100001002301411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4963773.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 100001002301411 its reverse (114103200100001), we get a palindrome (214104202401412).
The spelling of 100001002301411 in words is "one hundred trillion, one billion, two million, three hundred one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •