Base | Representation |
---|---|
bin | 100101011001111110… |
… | …010100100101011010 |
3 | 10211200010001112022100 |
4 | 211121332110211122 |
5 | 1124224014341010 |
6 | 30241242304230 |
7 | 2621210124054 |
oct | 453176244532 |
9 | 124603045270 |
10 | 40164215130 |
11 | 1604071a326 |
12 | 794aab8076 |
13 | 3a310ba790 |
14 | 1d303168d4 |
15 | 10a11232c0 |
hex | 959f9495a |
40164215130 has 96 divisors (see below), whose sum is σ = 119075143824. Its totient is φ = 9305008128.
The previous prime is 40164215101. The next prime is 40164215137. The reversal of 40164215130 is 3151246104.
It is a happy number.
40164215130 is a `hidden beast` number, since 4 + 0 + 1 + 642 + 1 + 5 + 13 + 0 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 5703119361 + 34461095769 = 75519^2 + 185637^2 .
It is a super-2 number, since 2×401642151302 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40164215094 and 40164215103.
It is not an unprimeable number, because it can be changed into a prime (40164215137) 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 47 ways as a sum of consecutive naturals, for example, 989769 + ... + 1029548.
Almost surely, 240164215130 is an apocalyptic number.
40164215130 is an abundant number, since it is smaller than the sum of its proper divisors (78910928694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40164215130 is a wasteful number, since it uses less digits than its factorization.
40164215130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2019360 (or 2019357 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 40164215130 in words is "forty billion, one hundred sixty-four million, two hundred fifteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •