Base | Representation |
---|---|
bin | 1000111000010011100… |
… | …0000000100011110111 |
3 | 112120202200121222010111 |
4 | 2032010320000203313 |
5 | 4444412100131411 |
6 | 154025411003451 |
7 | 14010260132425 |
oct | 2160470004367 |
9 | 476680558114 |
10 | 152553130231 |
11 | 597742a0737 |
12 | 25695899587 |
13 | 115024c19c8 |
14 | 75528b2115 |
15 | 3e7cd02721 |
hex | 2384e008f7 |
152553130231 has 4 divisors (see below), whose sum is σ = 161526843792. Its totient is φ = 143579416672.
The previous prime is 152553130217. The next prime is 152553130259. The reversal of 152553130231 is 132031355251.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152553130231 is a prime.
It is a super-2 number, since 2×1525531302312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152553130193 and 152553130202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152553130291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4486856755 + ... + 4486856788.
It is an arithmetic number, because the mean of its divisors is an integer number (40381710948).
Almost surely, 2152553130231 is an apocalyptic number.
152553130231 is a deficient number, since it is larger than the sum of its proper divisors (8973713561).
152553130231 is an equidigital number, since it uses as much as digits as its factorization.
152553130231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8973713560.
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 152553130231 its reverse (132031355251), we get a palindrome (284584485482).
The spelling of 152553130231 in words is "one hundred fifty-two billion, five hundred fifty-three million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •