Base | Representation |
---|---|
bin | 10010010011101011011101… |
… | …11000000100100110100111 |
3 | 12021112200110021002220102102 |
4 | 21021311232320010212213 |
5 | 20234044042144024322 |
6 | 221342312412402315 |
7 | 11323405233264002 |
oct | 1111655670044647 |
9 | 167480407086372 |
10 | 40258588658087 |
11 | 11911631838258 |
12 | 4622473a7639b |
13 | 19604a3b23a57 |
14 | 9d2751828539 |
15 | 49c341a5d792 |
hex | 249d6ee049a7 |
40258588658087 has 2 divisors, whose sum is σ = 40258588658088. Its totient is φ = 40258588658086.
The previous prime is 40258588658059. The next prime is 40258588658089. The reversal of 40258588658087 is 78085688585204.
40258588658087 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 40258588658087 - 230 = 40257514916263 is a prime.
Together with 40258588658089, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40258588658089) 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, 20129294329043 + 20129294329044.
It is an arithmetic number, because the mean of its divisors is an integer number (20129294329044).
Almost surely, 240258588658087 is an apocalyptic number.
40258588658087 is a deficient number, since it is larger than the sum of its proper divisors (1).
40258588658087 is an equidigital number, since it uses as much as digits as its factorization.
40258588658087 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1376256000, while the sum is 74.
The spelling of 40258588658087 in words is "forty trillion, two hundred fifty-eight billion, five hundred eighty-eight million, six hundred fifty-eight thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •