Base | Representation |
---|---|
bin | 10010010000001111101100… |
… | …11110000010010110011111 |
3 | 12021010101220202000010212101 |
4 | 21020013312132002112133 |
5 | 20230130424214401312 |
6 | 221212201125345531 |
7 | 11312030412125362 |
oct | 1110076636022637 |
9 | 167111822003771 |
10 | 40140604450207 |
11 | 11876597826638 |
12 | 46036272682a7 |
13 | 1952320452ab1 |
14 | 9cab5c0cc0d9 |
15 | 499238a39a57 |
hex | 2481f678259f |
40140604450207 has 2 divisors, whose sum is σ = 40140604450208. Its totient is φ = 40140604450206.
The previous prime is 40140604450169. The next prime is 40140604450231. The reversal of 40140604450207 is 70205440604104.
40140604450207 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 40140604450207 - 211 = 40140604448159 is a prime.
It is a super-2 number, since 2×401406044502072 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40140604450237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20070302225103 + 20070302225104.
It is an arithmetic number, because the mean of its divisors is an integer number (20070302225104).
Almost surely, 240140604450207 is an apocalyptic number.
40140604450207 is a deficient number, since it is larger than the sum of its proper divisors (1).
40140604450207 is an equidigital number, since it uses as much as digits as its factorization.
40140604450207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 107520, while the sum is 37.
The spelling of 40140604450207 in words is "forty trillion, one hundred forty billion, six hundred four million, four hundred fifty thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •