Base | Representation |
---|---|
bin | 10100110100100111000… |
… | …000011011011100010101 |
3 | 12001210100101101211002221 |
4 | 110310213000123130111 |
5 | 141420414401032042 |
6 | 3013200404502341 |
7 | 205243334566525 |
oct | 24644700333425 |
9 | 5053311354087 |
10 | 1430878533397 |
11 | 5019176a1485 |
12 | 1b13923aa9b1 |
13 | a4c14cba801 |
14 | 4d37d5c3685 |
15 | 27348e74d67 |
hex | 14d2701b715 |
1430878533397 has 2 divisors, whose sum is σ = 1430878533398. Its totient is φ = 1430878533396.
The previous prime is 1430878533379. The next prime is 1430878533401. The reversal of 1430878533397 is 7933358780341.
Together with previous prime (1430878533379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 965500794801 + 465377738596 = 982599^2 + 682186^2 .
It is a cyclic number.
It is not a de Polignac number, because 1430878533397 - 27 = 1430878533269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1430878543397) 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, 715439266698 + 715439266699.
It is an arithmetic number, because the mean of its divisors is an integer number (715439266699).
Almost surely, 21430878533397 is an apocalyptic number.
It is an amenable number.
1430878533397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1430878533397 is an equidigital number, since it uses as much as digits as its factorization.
1430878533397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45722880, while the sum is 61.
The spelling of 1430878533397 in words is "one trillion, four hundred thirty billion, eight hundred seventy-eight million, five hundred thirty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •