Base | Representation |
---|---|
bin | 100010111000010011110011… |
… | …010001101101100110100001 |
3 | 202010011012022010110020002112 |
4 | 202320103303101231212201 |
5 | 130101324104130410112 |
6 | 1302132232052325105 |
7 | 44212003436616236 |
oct | 4270236321554641 |
9 | 663135263406075 |
10 | 153403133450657 |
11 | 449739a3692182 |
12 | 1525667b013795 |
13 | 6779b12c4495c |
14 | 29c4a736d978d |
15 | 12b057a6c1a22 |
hex | 8b84f346d9a1 |
153403133450657 has 2 divisors, whose sum is σ = 153403133450658. Its totient is φ = 153403133450656.
The previous prime is 153403133450617. The next prime is 153403133450773. The reversal of 153403133450657 is 756054331304351.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100966403625616 + 52436729825041 = 10048204^2 + 7241321^2 .
It is a cyclic number.
It is not a de Polignac number, because 153403133450657 - 28 = 153403133450401 is a prime.
It is not a weakly prime, because it can be changed into another prime (153403133450617) 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, 76701566725328 + 76701566725329.
It is an arithmetic number, because the mean of its divisors is an integer number (76701566725329).
Almost surely, 2153403133450657 is an apocalyptic number.
It is an amenable number.
153403133450657 is a deficient number, since it is larger than the sum of its proper divisors (1).
153403133450657 is an equidigital number, since it uses as much as digits as its factorization.
153403133450657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804000, while the sum is 50.
The spelling of 153403133450657 in words is "one hundred fifty-three trillion, four hundred three billion, one hundred thirty-three million, four hundred fifty thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •