Base | Representation |
---|---|
bin | 10101011011110000… |
… | …001101011100101011 |
3 | 2012101220021112212200 |
4 | 111123300031130223 |
5 | 334113113414011 |
6 | 14323402111243 |
7 | 1443212324205 |
oct | 253360153453 |
9 | 65356245780 |
10 | 23014201131 |
11 | 983aa09a39 |
12 | 45634ab523 |
13 | 2229cc1cbc |
14 | 1184747775 |
15 | 8ea6b7856 |
hex | 55bc0d72b |
23014201131 has 6 divisors (see below), whose sum is σ = 33242734980. Its totient is φ = 15342800748.
The previous prime is 23014201127. The next prime is 23014201151. The reversal of 23014201131 is 13110241032.
23014201131 is a `hidden beast` number, since 230 + 1 + 420 + 1 + 13 + 1 = 666.
It is not a de Polignac number, because 23014201131 - 22 = 23014201127 is a prime.
It is a super-3 number, since 3×230142011313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (23014201151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1278566721 + ... + 1278566738.
It is an arithmetic number, because the mean of its divisors is an integer number (5540455830).
Almost surely, 223014201131 is an apocalyptic number.
23014201131 is a deficient number, since it is larger than the sum of its proper divisors (10228533849).
23014201131 is a wasteful number, since it uses less digits than its factorization.
23014201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2557133465 (or 2557133462 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 23014201131 its reverse (13110241032), we get a palindrome (36124442163).
The spelling of 23014201131 in words is "twenty-three billion, fourteen million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •