Base | Representation |
---|---|
bin | 100101010011001110… |
… | …110111000010001111 |
3 | 10211101020020012021121 |
4 | 211103032313002033 |
5 | 1124011041010111 |
6 | 30222122141411 |
7 | 2615334550432 |
oct | 452316670217 |
9 | 124336205247 |
10 | 40051110031 |
11 | 15a92897839 |
12 | 7919051867 |
13 | 3a13838c9a |
14 | 1d1d2b3819 |
15 | 1096230871 |
hex | 9533b708f |
40051110031 has 8 divisors (see below), whose sum is σ = 40414743824. Its totient is φ = 39689040960.
The previous prime is 40051110023. The next prime is 40051110037. The reversal of 40051110031 is 13001115004.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40051110031 - 23 = 40051110023 is a prime.
It is a super-2 number, since 2×400511100312 (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 = 40051109987 and 40051110014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40051110037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 339726 + ... + 442171.
It is an arithmetic number, because the mean of its divisors is an integer number (5051842978).
Almost surely, 240051110031 is an apocalyptic number.
40051110031 is a deficient number, since it is larger than the sum of its proper divisors (363633793).
40051110031 is a wasteful number, since it uses less digits than its factorization.
40051110031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782361.
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 40051110031 its reverse (13001115004), we get a palindrome (53052225035).
The spelling of 40051110031 in words is "forty billion, fifty-one million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •