Base | Representation |
---|---|
bin | 100101101000000001… |
… | …110011101100101111 |
3 | 10212021112202011002211 |
4 | 211220001303230233 |
5 | 1130214400310111 |
6 | 30320504231251 |
7 | 2630102263543 |
oct | 455001635457 |
9 | 125245664084 |
10 | 40400010031 |
11 | 16151830547 |
12 | 79b5a6b527 |
13 | 3a6abc85a4 |
14 | 1d53775a23 |
15 | 10b6b9d521 |
hex | 968073b2f |
40400010031 has 12 divisors (see below), whose sum is σ = 42487088952. Its totient is φ = 38393919648.
The previous prime is 40400010029. The next prime is 40400010103. The reversal of 40400010031 is 13001000404.
40400010031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40400010031 - 21 = 40400010029 is a prime.
It is a super-2 number, since 2×404000100312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40400009993 and 40400010020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40400010011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 284280 + ... + 402013.
It is an arithmetic number, because the mean of its divisors is an integer number (3540590746).
Almost surely, 240400010031 is an apocalyptic number.
40400010031 is a deficient number, since it is larger than the sum of its proper divisors (2087078921).
40400010031 is an equidigital number, since it uses as much as digits as its factorization.
40400010031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 686410 (or 686373 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 40400010031 its reverse (13001000404), we get a palindrome (53401010435).
The spelling of 40400010031 in words is "forty billion, four hundred million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.089 sec. • engine limits •