Base | Representation |
---|---|
bin | 1000110110101000101… |
… | …1010110101000010011 |
3 | 112112121110210121001012 |
4 | 2031222023112220103 |
5 | 4443002413412111 |
6 | 153513130401135 |
7 | 13663211002532 |
oct | 2155213265023 |
9 | 475543717035 |
10 | 152105216531 |
11 | 5956447a524 |
12 | 2558b8901ab |
13 | 11460775808 |
14 | 750d1d8319 |
15 | 3e5382748b |
hex | 236a2d6a13 |
152105216531 has 4 divisors (see below), whose sum is σ = 155642547192. Its totient is φ = 148567885872.
The previous prime is 152105216521. The next prime is 152105216539. The reversal of 152105216531 is 135612501251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 135612501251 = 479 ⋅283115869.
It is a cyclic number.
It is not a de Polignac number, because 152105216531 - 26 = 152105216467 is a prime.
It is a super-2 number, since 2×1521052165312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152105216539) 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, 1768665266 + ... + 1768665351.
It is an arithmetic number, because the mean of its divisors is an integer number (38910636798).
Almost surely, 2152105216531 is an apocalyptic number.
152105216531 is a deficient number, since it is larger than the sum of its proper divisors (3537330661).
152105216531 is an equidigital number, since it uses as much as digits as its factorization.
152105216531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3537330660.
The product of its (nonzero) digits is 9000, while the sum is 32.
Adding to 152105216531 its reverse (135612501251), we get a palindrome (287717717782).
The spelling of 152105216531 in words is "one hundred fifty-two billion, one hundred five million, two hundred sixteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •