Base | Representation |
---|---|
bin | 10011111100010110111… |
… | …000001100101111000111 |
3 | 11212000102222220001100021 |
4 | 103330112320030233013 |
5 | 134423214432222112 |
6 | 2525331124200011 |
7 | 201004506115516 |
oct | 23742670145707 |
9 | 4760388801307 |
10 | 1370478398407 |
11 | 489242367048 |
12 | 1a1736539007 |
13 | 9c30a6a2771 |
14 | 4a48d93267d |
15 | 259b1533907 |
hex | 13f16e0cbc7 |
1370478398407 has 2 divisors, whose sum is σ = 1370478398408. Its totient is φ = 1370478398406.
The previous prime is 1370478398389. The next prime is 1370478398411. The reversal of 1370478398407 is 7048938740731.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1370478398407 - 215 = 1370478365639 is a prime.
It is a super-2 number, since 2×13704783984072 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1370478398447) 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, 685239199203 + 685239199204.
It is an arithmetic number, because the mean of its divisors is an integer number (685239199204).
Almost surely, 21370478398407 is an apocalyptic number.
1370478398407 is a deficient number, since it is larger than the sum of its proper divisors (1).
1370478398407 is an equidigital number, since it uses as much as digits as its factorization.
1370478398407 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28449792, while the sum is 61.
The spelling of 1370478398407 in words is "one trillion, three hundred seventy billion, four hundred seventy-eight million, three hundred ninety-eight thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •