Base | Representation |
---|---|
bin | 1000110110110100000… |
… | …1001110011001000001 |
3 | 112112201210111210212002 |
4 | 2031231001032121001 |
5 | 4443102120033433 |
6 | 153521552313345 |
7 | 13664330152133 |
oct | 2155501163101 |
9 | 475653453762 |
10 | 152152892993 |
11 | 59589383562 |
12 | 255a3842855 |
13 | 1146a5c943a |
14 | 7515689053 |
15 | 3e57ae39e8 |
hex | 236d04e641 |
152152892993 has 2 divisors, whose sum is σ = 152152892994. Its totient is φ = 152152892992.
The previous prime is 152152892939. The next prime is 152152893031. The reversal of 152152892993 is 399298251251.
Together with previous prime (152152892939) 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., 117010516624 + 35142376369 = 342068^2 + 187463^2 .
It is an emirp because it is prime and its reverse (399298251251) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152152892993 is a prime.
It is a super-2 number, since 2×1521528929932 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (152152802993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76076446496 + 76076446497.
It is an arithmetic number, because the mean of its divisors is an integer number (76076446497).
Almost surely, 2152152892993 is an apocalyptic number.
It is an amenable number.
152152892993 is a deficient number, since it is larger than the sum of its proper divisors (1).
152152892993 is an equidigital number, since it uses as much as digits as its factorization.
152152892993 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3499200, while the sum is 56.
The spelling of 152152892993 in words is "one hundred fifty-two billion, one hundred fifty-two million, eight hundred ninety-two thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •