Base | Representation |
---|---|
bin | 100101100010101010… |
… | …011100100111100100 |
3 | 10212001021101011200200 |
4 | 211202222130213210 |
5 | 1130023330000400 |
6 | 30303531110500 |
7 | 2624630230116 |
oct | 454252344744 |
9 | 125037334620 |
10 | 40310000100 |
11 | 16105a42777 |
12 | 798b8a2430 |
13 | 3a55371c86 |
14 | 1d458253b6 |
15 | 10add1db00 |
hex | 962a9c9e4 |
40310000100 has 216 divisors, whose sum is σ = 132069380352. Its totient is φ = 10264320000.
The previous prime is 40310000089. The next prime is 40310000147. The reversal of 40310000100 is 100001304.
It is a super-2 number, since 2×403100001002 (a number of 22 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 71 ways as a sum of consecutive naturals, for example, 15544404 + ... + 15546996.
Almost surely, 240310000100 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40310000100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66034690176).
40310000100 is an abundant number, since it is smaller than the sum of its proper divisors (91759380252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40310000100 is a wasteful number, since it uses less digits than its factorization.
40310000100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3387 (or 3377 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 40310000100 its reverse (100001304), we get a palindrome (40410001404).
The spelling of 40310000100 in words is "forty billion, three hundred ten million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •