Base | Representation |
---|---|
bin | 100101010000011011… |
… | …100101101010011110 |
3 | 10211020221210121100200 |
4 | 211100123211222132 |
5 | 1123412023140402 |
6 | 30213323004330 |
7 | 2614224240120 |
oct | 452033455236 |
9 | 124227717320 |
10 | 40004115102 |
11 | 15a69309856 |
12 | 79053696a6 |
13 | 3a06b93633 |
14 | 1d16d5d210 |
15 | 109204b21c |
hex | 9506e5a9e |
40004115102 has 48 divisors (see below), whose sum is σ = 99068935680. Its totient is φ = 11428463376.
The previous prime is 40004115077. The next prime is 40004115103. The reversal of 40004115102 is 20151140004.
40004115102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40004115103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2152783 + ... + 2171285.
It is an arithmetic number, because the mean of its divisors is an integer number (2063936160).
Almost surely, 240004115102 is an apocalyptic number.
40004115102 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
40004115102 is an abundant number, since it is smaller than the sum of its proper divisors (59064820578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40004115102 is a wasteful number, since it uses less digits than its factorization.
40004115102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35677 (or 35674 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 40004115102 its reverse (20151140004), we get a palindrome (60155255106).
The spelling of 40004115102 in words is "forty billion, four million, one hundred fifteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •