Base | Representation |
---|---|
bin | 1000011101010010100… |
… | …1110011110011001111 |
3 | 111220001022200122012021 |
4 | 2013110221303303033 |
5 | 4340034210310024 |
6 | 150430050351011 |
7 | 13332465436465 |
oct | 2072451636317 |
9 | 456038618167 |
10 | 145301650639 |
11 | 56692aa27a2 |
12 | 241b128b467 |
13 | 10918078a92 |
14 | 70657b2835 |
15 | 3ba63b0de4 |
hex | 21d4a73ccf |
145301650639 has 2 divisors, whose sum is σ = 145301650640. Its totient is φ = 145301650638.
The previous prime is 145301650609. The next prime is 145301650649. The reversal of 145301650639 is 936056103541.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145301650639 - 215 = 145301617871 is a prime.
It is a super-2 number, since 2×1453016506392 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145301650595 and 145301650604.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145301650609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72650825319 + 72650825320.
It is an arithmetic number, because the mean of its divisors is an integer number (72650825320).
Almost surely, 2145301650639 is an apocalyptic number.
145301650639 is a deficient number, since it is larger than the sum of its proper divisors (1).
145301650639 is an equidigital number, since it uses as much as digits as its factorization.
145301650639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 291600, while the sum is 43.
The spelling of 145301650639 in words is "one hundred forty-five billion, three hundred one million, six hundred fifty thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •