Base | Representation |
---|---|
bin | 100101010010111101… |
… | …000011011111000101 |
3 | 10211100220110001112202 |
4 | 211102331003133011 |
5 | 1124003342124222 |
6 | 30221434124245 |
7 | 2615250100331 |
oct | 452275033705 |
9 | 124326401482 |
10 | 40046442437 |
11 | 15a90199a21 |
12 | 7917580685 |
13 | 3a128935b1 |
14 | 1d1c81a7c1 |
15 | 1095b0c892 |
hex | 952f437c5 |
40046442437 has 2 divisors, whose sum is σ = 40046442438. Its totient is φ = 40046442436.
The previous prime is 40046442431. The next prime is 40046442473. The reversal of 40046442437 is 73424464004.
Together with next prime (40046442473) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33709327201 + 6337115236 = 183601^2 + 79606^2 .
It is a cyclic number.
It is not a de Polignac number, because 40046442437 - 28 = 40046442181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40046442437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40046442431) 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 as a sum of consecutive naturals, namely, 20023221218 + 20023221219.
It is an arithmetic number, because the mean of its divisors is an integer number (20023221219).
Almost surely, 240046442437 is an apocalyptic number.
It is an amenable number.
40046442437 is a deficient number, since it is larger than the sum of its proper divisors (1).
40046442437 is an equidigital number, since it uses as much as digits as its factorization.
40046442437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 258048, while the sum is 38.
The spelling of 40046442437 in words is "forty billion, forty-six million, four hundred forty-two thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •