Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …110011001001111001100011 |
3 | 111010210010022220011021110022 |
4 | 112302013131303021321203 |
5 | 101113143133341114021 |
6 | 553035413205424055 |
7 | 30051166342302221 |
oct | 2662073563117143 |
9 | 433703286137408 |
10 | 100201013223011 |
11 | 29a22013802868 |
12 | b2a376470b02b |
13 | 43babb8351b5c |
14 | 1aa5a7d6c3b11 |
15 | b8b6d1b881ab |
hex | 5b21ddcc9e63 |
100201013223011 has 8 divisors (see below), whose sum is σ = 100494133705440. Its totient is φ = 99908127523008.
The previous prime is 100201013223001. The next prime is 100201013223043. The reversal of 100201013223011 is 110322310102001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100201013223011 is a prime.
It is a super-2 number, since 2×1002010132230112 (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 (100201013223001) 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, 57840776 + ... + 59547941.
It is an arithmetic number, because the mean of its divisors is an integer number (12561766713180).
Almost surely, 2100201013223011 is an apocalyptic number.
100201013223011 is a deficient number, since it is larger than the sum of its proper divisors (293120482429).
100201013223011 is a wasteful number, since it uses less digits than its factorization.
100201013223011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117391213.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 100201013223011 its reverse (110322310102001), we get a palindrome (210523323325012).
The spelling of 100201013223011 in words is "one hundred trillion, two hundred one billion, thirteen million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •