Base | Representation |
---|---|
bin | 10101101110000000… |
… | …110011100011110111 |
3 | 2020012020201020202201 |
4 | 111232000303203313 |
5 | 340230024311211 |
6 | 14414024045331 |
7 | 1453622221465 |
oct | 255600634367 |
9 | 66166636681 |
10 | 23320541431 |
11 | 9987923a40 |
12 | 462a003847 |
13 | 22785cc955 |
14 | 11b32cb835 |
15 | 91752a0c1 |
hex | 56e0338f7 |
23320541431 has 4 divisors (see below), whose sum is σ = 25440590664. Its totient is φ = 21200492200.
The previous prime is 23320541417. The next prime is 23320541443. The reversal of 23320541431 is 13414502332.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23320541431 - 27 = 23320541303 is a prime.
It is a super-2 number, since 2×233205414312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23320541431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23320541471) 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 3 ways as a sum of consecutive naturals, for example, 1060024600 + ... + 1060024621.
It is an arithmetic number, because the mean of its divisors is an integer number (6360147666).
Almost surely, 223320541431 is an apocalyptic number.
23320541431 is a deficient number, since it is larger than the sum of its proper divisors (2120049233).
23320541431 is a wasteful number, since it uses less digits than its factorization.
23320541431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2120049232.
The product of its (nonzero) digits is 8640, while the sum is 28.
The spelling of 23320541431 in words is "twenty-three billion, three hundred twenty million, five hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •