Base | Representation |
---|---|
bin | 100010111000010011001011… |
… | …001110010010011101110001 |
3 | 202010011010120021222210021212 |
4 | 202320103023032102131301 |
5 | 130101321220113330213 |
6 | 1302132041245325505 |
7 | 44211651000051566 |
oct | 4270231316223561 |
9 | 663133507883255 |
10 | 153402461464433 |
11 | 44973689336a65 |
12 | 15256511b66895 |
13 | 6779a3696347c |
14 | 29c4a0c37486d |
15 | 12b053b6d49a8 |
hex | 8b84cb392771 |
153402461464433 has 16 divisors (see below), whose sum is σ = 154351203747840. Its totient is φ = 152455466116800.
The previous prime is 153402461464393. The next prime is 153402461464459. The reversal of 153402461464433 is 334464164204351.
It is a cyclic number.
It is not a de Polignac number, because 153402461464433 - 232 = 153398166497137 is a prime.
It is a super-2 number, since 2×1534024614644332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (153402461464463) 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 in 15 ways as a sum of consecutive naturals, for example, 2526402248 + ... + 2526462966.
It is an arithmetic number, because the mean of its divisors is an integer number (9646950234240).
Almost surely, 2153402461464433 is an apocalyptic number.
It is an amenable number.
153402461464433 is a deficient number, since it is larger than the sum of its proper divisors (948742283407).
153402461464433 is a wasteful number, since it uses less digits than its factorization.
153402461464433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74848.
The product of its (nonzero) digits is 9953280, while the sum is 50.
The spelling of 153402461464433 in words is "one hundred fifty-three trillion, four hundred two billion, four hundred sixty-one million, four hundred sixty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •