Base | Representation |
---|---|
bin | 1000110111111001000… |
… | …0111110010101110111 |
3 | 112120110221221212102020 |
4 | 2031332100332111313 |
5 | 4444200202443411 |
6 | 154010410044223 |
7 | 14004442416450 |
oct | 2157620762567 |
9 | 476427855366 |
10 | 152442234231 |
11 | 59717737951 |
12 | 25664719673 |
13 | 114b5534881 |
14 | 7541c86127 |
15 | 3e731e9606 |
hex | 237e43e577 |
152442234231 has 32 divisors (see below), whose sum is σ = 235094458368. Its totient is φ = 86064975360.
The previous prime is 152442234181. The next prime is 152442234239. The reversal of 152442234231 is 132432244251.
It is a happy number.
It is not a de Polignac number, because 152442234231 - 211 = 152442232183 is a prime.
It is a super-2 number, since 2×1524422342312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 152442234192 and 152442234201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152442234239) 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 31 ways as a sum of consecutive naturals, for example, 524161 + ... + 761333.
It is an arithmetic number, because the mean of its divisors is an integer number (7346701824).
Almost surely, 2152442234231 is an apocalyptic number.
152442234231 is a deficient number, since it is larger than the sum of its proper divisors (82652224137).
152442234231 is a wasteful number, since it uses less digits than its factorization.
152442234231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237551.
The product of its digits is 46080, while the sum is 33.
Adding to 152442234231 its reverse (132432244251), we get a palindrome (284874478482).
The spelling of 152442234231 in words is "one hundred fifty-two billion, four hundred forty-two million, two hundred thirty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •