Base | Representation |
---|---|
bin | 10110110010000111100010… |
… | …111110010000110100010011 |
3 | 111010210010112221111001221001 |
4 | 112302013202332100310103 |
5 | 101113143323101133021 |
6 | 553035425550042431 |
7 | 30051201445130503 |
oct | 2662074276206423 |
9 | 433703487431831 |
10 | 100201100021011 |
11 | 29a220587a7450 |
12 | b2a37897a9417 |
13 | 43bac00322512 |
14 | 1aa5a8b039a03 |
15 | b8b6d95d1091 |
hex | 5b21e2f90d13 |
100201100021011 has 32 divisors (see below), whose sum is σ = 118551802913280. Its totient is φ = 83720103379200.
The previous prime is 100201100020999. The next prime is 100201100021051. The reversal of 100201100021011 is 110120001102001.
It is a cyclic number.
It is not a de Polignac number, because 100201100021011 - 229 = 100200563150099 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100201100021051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52901695 + ... + 54763048.
It is an arithmetic number, because the mean of its divisors is an integer number (3704743841040).
Almost surely, 2100201100021011 is an apocalyptic number.
100201100021011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100201100021011 is a deficient number, since it is larger than the sum of its proper divisors (18350702892269).
100201100021011 is a wasteful number, since it uses less digits than its factorization.
100201100021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107664907.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100201100021011 its reverse (110120001102001), we get a palindrome (210321101123012).
The spelling of 100201100021011 in words is "one hundred trillion, two hundred one billion, one hundred million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •