Base | Representation |
---|---|
bin | 1000111000110000001… |
… | …0010100011110010111 |
3 | 112121002001200220001111 |
4 | 2032030002110132113 |
5 | 10000133324230001 |
6 | 154045342035451 |
7 | 14013246262165 |
oct | 2161402243627 |
9 | 477061626044 |
10 | 152673273751 |
11 | 598260a02a9 |
12 | 25709b78b87 |
13 | 1152136904b |
14 | 7564828235 |
15 | 3e88635851 |
hex | 238c094797 |
152673273751 has 2 divisors, whose sum is σ = 152673273752. Its totient is φ = 152673273750.
The previous prime is 152673273667. The next prime is 152673273773. The reversal of 152673273751 is 157372376251.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 152673273751 - 235 = 118313535383 is a prime.
It is a super-2 number, since 2×1526732737512 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 152673273695 and 152673273704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152673273451) 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, 76336636875 + 76336636876.
It is an arithmetic number, because the mean of its divisors is an integer number (76336636876).
Almost surely, 2152673273751 is an apocalyptic number.
152673273751 is a deficient number, since it is larger than the sum of its proper divisors (1).
152673273751 is an equidigital number, since it uses as much as digits as its factorization.
152673273751 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1852200, while the sum is 49.
Subtracting 152673273751 from its reverse (157372376251), we obtain a square (4699102500 = 685502).
The spelling of 152673273751 in words is "one hundred fifty-two billion, six hundred seventy-three million, two hundred seventy-three thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •