Base | Representation |
---|---|
bin | 1000111010000001101… |
… | …0011011111010000001 |
3 | 112121221212222111100021 |
4 | 2032200122123322001 |
5 | 10001333333434334 |
6 | 154143313253441 |
7 | 14024600141536 |
oct | 2164032337201 |
9 | 477855874307 |
10 | 153015139969 |
11 | 5999106a46a |
12 | 257a4564281 |
13 | 11577134c53 |
14 | 7597db8d8d |
15 | 3ea86643b4 |
hex | 23a069be81 |
153015139969 has 2 divisors, whose sum is σ = 153015139970. Its totient is φ = 153015139968.
The previous prime is 153015139957. The next prime is 153015140017. The reversal of 153015139969 is 969931510351.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88200090225 + 64815049744 = 296985^2 + 254588^2 .
It is an emirp because it is prime and its reverse (969931510351) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-153015139969 is a prime.
It is a super-2 number, since 2×1530151399692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (153015139909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76507569984 + 76507569985.
It is an arithmetic number, because the mean of its divisors is an integer number (76507569985).
Almost surely, 2153015139969 is an apocalyptic number.
It is an amenable number.
153015139969 is a deficient number, since it is larger than the sum of its proper divisors (1).
153015139969 is an equidigital number, since it uses as much as digits as its factorization.
153015139969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 984150, while the sum is 52.
The spelling of 153015139969 in words is "one hundred fifty-three billion, fifteen million, one hundred thirty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •