Base | Representation |
---|---|
bin | 1000110011100000100… |
… | …0001010100110000001 |
3 | 112110102221202120221201 |
4 | 2030320020022212001 |
5 | 4434242433120001 |
6 | 153253533021201 |
7 | 13633333463641 |
oct | 2147010124601 |
9 | 473387676851 |
10 | 151265520001 |
11 | 59173496052 |
12 | 25396624801 |
13 | 1135880426b |
14 | 746d898521 |
15 | 3e04c5d501 |
hex | 233820a981 |
151265520001 has 2 divisors, whose sum is σ = 151265520002. Its totient is φ = 151265520000.
The previous prime is 151265519981. The next prime is 151265520011. The reversal of 151265520001 is 100025562151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99133671025 + 52131848976 = 314855^2 + 228324^2 .
It is an emirp because it is prime and its reverse (100025562151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 151265520001 - 217 = 151265388929 is a prime.
It is not a weakly prime, because it can be changed into another prime (151265520011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75632760000 + 75632760001.
It is an arithmetic number, because the mean of its divisors is an integer number (75632760001).
Almost surely, 2151265520001 is an apocalyptic number.
It is an amenable number.
151265520001 is a deficient number, since it is larger than the sum of its proper divisors (1).
151265520001 is an equidigital number, since it uses as much as digits as its factorization.
151265520001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 28.
The spelling of 151265520001 in words is "one hundred fifty-one billion, two hundred sixty-five million, five hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •