Base | Representation |
---|---|
bin | 100001000001100110111000… |
… | …110110110100001111110111 |
3 | 201001021101100012101011221221 |
4 | 201001212320312310033313 |
5 | 123014202312132120414 |
6 | 1232525032424451211 |
7 | 42410451353131033 |
oct | 4101467066641767 |
9 | 631241305334857 |
10 | 145246010426359 |
11 | 4230953a36a257 |
12 | 14359797019b07 |
13 | 6307842152a8b |
14 | 27c1d316871c3 |
15 | 11bd2ae661224 |
hex | 8419b8db43f7 |
145246010426359 has 2 divisors, whose sum is σ = 145246010426360. Its totient is φ = 145246010426358.
The previous prime is 145246010426329. The next prime is 145246010426371. The reversal of 145246010426359 is 953624010642541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145246010426359 - 211 = 145246010424311 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145246010426329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72623005213179 + 72623005213180.
It is an arithmetic number, because the mean of its divisors is an integer number (72623005213180).
Almost surely, 2145246010426359 is an apocalyptic number.
145246010426359 is a deficient number, since it is larger than the sum of its proper divisors (1).
145246010426359 is an equidigital number, since it uses as much as digits as its factorization.
145246010426359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6220800, while the sum is 52.
The spelling of 145246010426359 in words is "one hundred forty-five trillion, two hundred forty-six billion, ten million, four hundred twenty-six thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •