Base | Representation |
---|---|
bin | 10100100011111111010… |
… | …001010011100111010101 |
3 | 12000002021121222222121221 |
4 | 110203333101103213111 |
5 | 141122342142444312 |
6 | 3001045443410341 |
7 | 204042151553014 |
oct | 24437721234725 |
9 | 5002247888557 |
10 | 1413031999957 |
11 | 4a52997a9796 |
12 | 1a9a316839b1 |
13 | a332c800c56 |
14 | 4c569304a7b |
15 | 26b522d3207 |
hex | 148ff4539d5 |
1413031999957 has 2 divisors, whose sum is σ = 1413031999958. Its totient is φ = 1413031999956.
The previous prime is 1413031999949. The next prime is 1413032000041. The reversal of 1413031999957 is 7599991303141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1394002901041 + 19029098916 = 1180679^2 + 137946^2 .
It is a cyclic number.
It is not a de Polignac number, because 1413031999957 - 23 = 1413031999949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1413031999895 and 1413031999904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1413031999157) 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, 706515999978 + 706515999979.
It is an arithmetic number, because the mean of its divisors is an integer number (706515999979).
Almost surely, 21413031999957 is an apocalyptic number.
It is an amenable number.
1413031999957 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413031999957 is an equidigital number, since it uses as much as digits as its factorization.
1413031999957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8266860, while the sum is 61.
The spelling of 1413031999957 in words is "one trillion, four hundred thirteen billion, thirty-one million, nine hundred ninety-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •