Base | Representation |
---|---|
bin | 100010101011100111101011… |
… | …100110111000111010110111 |
3 | 202000001211111110101111011220 |
4 | 202223213223212320322313 |
5 | 124443032221331020343 |
6 | 1300223455423401423 |
7 | 44062003335313512 |
oct | 4253475346707267 |
9 | 660054443344156 |
10 | 152531126423223 |
11 | 446680a6429a59 |
12 | 15135679753273 |
13 | 6715814ab5a52 |
14 | 299478dd93d79 |
15 | 1297a409be183 |
hex | 8ab9eb9b8eb7 |
152531126423223 has 8 divisors (see below), whose sum is σ = 203382493387248. Its totient is φ = 101683588537344.
The previous prime is 152531126423201. The next prime is 152531126423231. The reversal of 152531126423223 is 322324621135251.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 152531126423223 - 217 = 152531126292151 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152531126423233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 957176586 + ... + 957335927.
It is an arithmetic number, because the mean of its divisors is an integer number (25422811673406).
Almost surely, 2152531126423223 is an apocalyptic number.
152531126423223 is a deficient number, since it is larger than the sum of its proper divisors (50851366964025).
152531126423223 is a wasteful number, since it uses less digits than its factorization.
152531126423223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1914539073.
The product of its digits is 518400, while the sum is 42.
Adding to 152531126423223 its reverse (322324621135251), we get a palindrome (474855747558474).
The spelling of 152531126423223 in words is "one hundred fifty-two trillion, five hundred thirty-one billion, one hundred twenty-six million, four hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •