Base | Representation |
---|---|
bin | 101110100100010000… |
… | …1100101000110111001 |
3 | 100120010020112122212000 |
4 | 1131020201211012321 |
5 | 3114300224310410 |
6 | 113535000411213 |
7 | 10140055363263 |
oct | 1351041450671 |
9 | 316106478760 |
10 | 100001010105 |
11 | 39456a65aa7 |
12 | 1746a176b09 |
13 | 9578aa4439 |
14 | 4ba9244b33 |
15 | 2904388dc0 |
hex | 17488651b9 |
100001010105 has 16 divisors (see below), whose sum is σ = 177779573760. Its totient is φ = 53333871984.
The previous prime is 100001010091. The next prime is 100001010127. The reversal of 100001010105 is 501010100001.
It is not a de Polignac number, because 100001010105 - 215 = 100000977337 is a prime.
It is a super-2 number, since 2×1000010101052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
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, 370373977 + ... + 370374246.
It is an arithmetic number, because the mean of its divisors is an integer number (11111223360).
Almost surely, 2100001010105 is an apocalyptic number.
100001010105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
100001010105 is a deficient number, since it is larger than the sum of its proper divisors (77778563655).
100001010105 is an equidigital number, since it uses as much as digits as its factorization.
100001010105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740748237 (or 740748231 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 100001010105 its reverse (501010100001), we get a palindrome (601011110106).
The spelling of 100001010105 in words is "one hundred billion, one million, ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •