Base | Representation |
---|---|
bin | 101101100010110010011110… |
… | …1010011000111111100010001 |
3 | 1221112102111211222211202210022 |
4 | 1123011210331103013330101 |
5 | 410002010042313220444 |
6 | 3540003344304313225 |
7 | 150244536031462412 |
oct | 13305447523077421 |
9 | 1845374758752708 |
10 | 400605513023249 |
11 | 106710931379156 |
12 | 38b20047912815 |
13 | 1426bc263cb8a1 |
14 | 70cd5a5b75809 |
15 | 314aa06e8e9ee |
hex | 16c593d4c7f11 |
400605513023249 has 2 divisors, whose sum is σ = 400605513023250. Its totient is φ = 400605513023248.
The previous prime is 400605513023197. The next prime is 400605513023293. The reversal of 400605513023249 is 942320315506004.
It is a happy number.
It is an a-pointer prime, because the next prime (400605513023293) can be obtained adding 400605513023249 to its sum of digits (44).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 400595421414400 + 10091608849 = 20014880^2 + 100457^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-400605513023249 is a prime.
It is not a weakly prime, because it can be changed into another prime (400605513023449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200302756511624 + 200302756511625.
It is an arithmetic number, because the mean of its divisors is an integer number (200302756511625).
Almost surely, 2400605513023249 is an apocalyptic number.
It is an amenable number.
400605513023249 is a deficient number, since it is larger than the sum of its proper divisors (1).
400605513023249 is an equidigital number, since it uses as much as digits as its factorization.
400605513023249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 777600, while the sum is 44.
The spelling of 400605513023249 in words is "four hundred trillion, six hundred five billion, five hundred thirteen million, twenty-three thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •