Base | Representation |
---|---|
bin | 101110100100110111… |
… | …0111110111100010101 |
3 | 100120011122201112202010 |
4 | 1131021232332330111 |
5 | 3114320423113023 |
6 | 113541003334433 |
7 | 10140423013404 |
oct | 1351156767425 |
9 | 316148645663 |
10 | 100021301013 |
11 | 39467464947 |
12 | 17474b21419 |
13 | 958005a0aa |
14 | 4babc0763b |
15 | 2906046093 |
hex | 1749bbef15 |
100021301013 has 32 divisors (see below), whose sum is σ = 136271640960. Its totient is φ = 65240398080.
The previous prime is 100021300987. The next prime is 100021301021. The reversal of 100021301013 is 310103120001.
It is not a de Polignac number, because 100021301013 - 29 = 100021300501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100021301013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100021301033) 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, 44711131 + ... + 44713367.
It is an arithmetic number, because the mean of its divisors is an integer number (4258488780).
Almost surely, 2100021301013 is an apocalyptic number.
It is an amenable number.
100021301013 is a deficient number, since it is larger than the sum of its proper divisors (36250339947).
100021301013 is a wasteful number, since it uses less digits than its factorization.
100021301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3717.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 100021301013 its reverse (310103120001), we get a palindrome (410124421014).
The spelling of 100021301013 in words is "one hundred billion, twenty-one million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •