Base | Representation |
---|---|
bin | 101110101110000100… |
… | …0101010010001110001 |
3 | 100120222011122012022210 |
4 | 1131130020222101301 |
5 | 3120433441201001 |
6 | 114031352322333 |
7 | 10151162054526 |
oct | 1353410522161 |
9 | 316864565283 |
10 | 100330022001 |
11 | 39605755560 |
12 | 175403a33a9 |
13 | 95cbcbc531 |
14 | 4bdac0b14d |
15 | 29231c8dd6 |
hex | 175c22a471 |
100330022001 has 16 divisors (see below), whose sum is σ = 145941094080. Its totient is φ = 60803358720.
The previous prime is 100330021997. The next prime is 100330022053. The reversal of 100330022001 is 100220033001.
It is a happy number.
It is not a de Polignac number, because 100330022001 - 22 = 100330021997 is a prime.
It is a super-2 number, since 2×1003300220012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100330022081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 879801 + ... + 987273.
It is an arithmetic number, because the mean of its divisors is an integer number (9121318380).
Almost surely, 2100330022001 is an apocalyptic number.
100330022001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100330022001 is a deficient number, since it is larger than the sum of its proper divisors (45611072079).
100330022001 is a wasteful number, since it uses less digits than its factorization.
100330022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135776.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 100330022001 its reverse (100220033001), we get a palindrome (200550055002).
The spelling of 100330022001 in words is "one hundred billion, three hundred thirty million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •