Base | Representation |
---|---|
bin | 1000011100001101110… |
… | …1100001010101111111 |
3 | 111212022012221200010112 |
4 | 2013003131201111333 |
5 | 4333441340413024 |
6 | 150341304300235 |
7 | 13322364001154 |
oct | 2070335412577 |
9 | 455265850115 |
10 | 145013216639 |
11 | 565551a8a95 |
12 | 2413077167b |
13 | 108a039a585 |
14 | 703937022b |
15 | 3b8add900e |
hex | 21c376157f |
145013216639 has 2 divisors, whose sum is σ = 145013216640. Its totient is φ = 145013216638.
The previous prime is 145013216617. The next prime is 145013216671. The reversal of 145013216639 is 936612310541.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145013216639 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145013216596 and 145013216605.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145013216239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72506608319 + 72506608320.
It is an arithmetic number, because the mean of its divisors is an integer number (72506608320).
Almost surely, 2145013216639 is an apocalyptic number.
145013216639 is a deficient number, since it is larger than the sum of its proper divisors (1).
145013216639 is an equidigital number, since it uses as much as digits as its factorization.
145013216639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 41.
The spelling of 145013216639 in words is "one hundred forty-five billion, thirteen million, two hundred sixteen thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •