Base | Representation |
---|---|
bin | 100010110001101100010110… |
… | …111001000110000001111101 |
3 | 202001112201201110111112202111 |
4 | 202301230112321012001331 |
5 | 130021401423344143032 |
6 | 1301143315441454021 |
7 | 44134106350046611 |
oct | 4261542671060175 |
9 | 661481643445674 |
10 | 152948464443517 |
11 | 44809096902646 |
12 | 151a252b341311 |
13 | 6745c944679a2 |
14 | 29aaa60aa5341 |
15 | 12a38195adc47 |
hex | 8b1b16e4607d |
152948464443517 has 2 divisors, whose sum is σ = 152948464443518. Its totient is φ = 152948464443516.
The previous prime is 152948464443499. The next prime is 152948464443527. The reversal of 152948464443517 is 715344464849251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96246871681401 + 56701592762116 = 9810549^2 + 7530046^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152948464443517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152948464443527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76474232221758 + 76474232221759.
It is an arithmetic number, because the mean of its divisors is an integer number (76474232221759).
Almost surely, 2152948464443517 is an apocalyptic number.
It is an amenable number.
152948464443517 is a deficient number, since it is larger than the sum of its proper divisors (1).
152948464443517 is an equidigital number, since it uses as much as digits as its factorization.
152948464443517 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 464486400, while the sum is 67.
The spelling of 152948464443517 in words is "one hundred fifty-two trillion, nine hundred forty-eight billion, four hundred sixty-four million, four hundred forty-three thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •