Base | Representation |
---|---|
bin | 10010101111011100… |
… | …010011000111100011 |
3 | 1220221102112120111101 |
4 | 102233130103013203 |
5 | 312203031102243 |
6 | 13124452055231 |
7 | 1311450142030 |
oct | 225734230743 |
9 | 56842476441 |
10 | 20123300323 |
11 | 8597095415 |
12 | 3a97304517 |
13 | 1b890b8ac9 |
14 | d8c820387 |
15 | 7cb9c454d |
hex | 4af7131e3 |
20123300323 has 16 divisors (see below), whose sum is σ = 24583297536. Its totient is φ = 16096196160.
The previous prime is 20123300317. The next prime is 20123300341. The reversal of 20123300323 is 32300332102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20123300323 - 25 = 20123300291 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20123300323.
It is not an unprimeable number, because it can be changed into a prime (20123300363) 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 15 ways as a sum of consecutive naturals, for example, 1517661 + ... + 1530862.
It is an arithmetic number, because the mean of its divisors is an integer number (1536456096).
Almost surely, 220123300323 is an apocalyptic number.
20123300323 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
20123300323 is a deficient number, since it is larger than the sum of its proper divisors (4459997213).
20123300323 is a wasteful number, since it uses less digits than its factorization.
20123300323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3048594.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 20123300323 its reverse (32300332102), we get a palindrome (52423632425).
The spelling of 20123300323 in words is "twenty billion, one hundred twenty-three million, three hundred thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •