Base | Representation |
---|---|
bin | 101110101101110001… |
… | …1111110011001110001 |
3 | 100120221111112121102110 |
4 | 1131123203332121301 |
5 | 3120424010430410 |
6 | 114030410235533 |
7 | 10151014242114 |
oct | 1353343763161 |
9 | 316844477373 |
10 | 100320405105 |
11 | 39600287208 |
12 | 17539125ba9 |
13 | 95ca00316b |
14 | 4bd982657b |
15 | 2922429720 |
hex | 175b8fe671 |
100320405105 has 16 divisors (see below), whose sum is σ = 163144004544. Its totient is φ = 52627097280.
The previous prime is 100320405103. The next prime is 100320405167. The reversal of 100320405105 is 501504023001.
It is not a de Polignac number, because 100320405105 - 21 = 100320405103 is a prime.
It is a super-2 number, since 2×1003204051052 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (100320405103) 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 15 ways as a sum of consecutive naturals, for example, 54818979 + ... + 54820808.
It is an arithmetic number, because the mean of its divisors is an integer number (10196500284).
Almost surely, 2100320405105 is an apocalyptic number.
100320405105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
100320405105 is a deficient number, since it is larger than the sum of its proper divisors (62823599439).
100320405105 is a wasteful number, since it uses less digits than its factorization.
100320405105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109639856.
The product of its (nonzero) digits is 600, while the sum is 21.
Adding to 100320405105 its reverse (501504023001), we get a palindrome (601824428106).
The spelling of 100320405105 in words is "one hundred billion, three hundred twenty million, four hundred five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •