Base | Representation |
---|---|
bin | 100101111010011100… |
… | …001101001101000011 |
3 | 10220002002000102002122 |
4 | 211322130031031003 |
5 | 1131332440421011 |
6 | 30411301234455 |
7 | 2640543053225 |
oct | 457234151503 |
9 | 126062012078 |
10 | 40708920131 |
11 | 162a0140250 |
12 | 7a81402a2b |
13 | 3ab9bc5b29 |
14 | 1d827c8415 |
15 | 10d3d6c3db |
hex | 97a70d343 |
40708920131 has 16 divisors (see below), whose sum is σ = 45820252800. Its totient is φ = 35845665600.
The previous prime is 40708920113. The next prime is 40708920151. The reversal of 40708920131 is 13102980704.
40708920131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 40708920131 - 26 = 40708920067 is a prime.
It is a super-2 number, since 2×407089201312 (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 = 40708920091 and 40708920100.
It is not an unprimeable number, because it can be changed into a prime (40708920151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 262001 + ... + 387378.
It is an arithmetic number, because the mean of its divisors is an integer number (2863765800).
Almost surely, 240708920131 is an apocalyptic number.
40708920131 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
40708920131 is a deficient number, since it is larger than the sum of its proper divisors (5111332669).
40708920131 is a wasteful number, since it uses less digits than its factorization.
40708920131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 649570.
The product of its (nonzero) digits is 12096, while the sum is 35.
The spelling of 40708920131 in words is "forty billion, seven hundred eight million, nine hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •