Base | Representation |
---|---|
bin | 1101101001110010011100… |
… | …01100001000001110101011 |
3 | 10221022011221202220010221022 |
4 | 12310321032030020032223 |
5 | 12413344334044420243 |
6 | 143504234220003055 |
7 | 6216046141351643 |
oct | 664711614101653 |
9 | 127264852803838 |
10 | 30023133201323 |
11 | 9625814a99659 |
12 | 344a82669048b |
13 | 139a227c98062 |
14 | 75b1ad82d523 |
15 | 370e85b4ab68 |
hex | 1b4e4e3083ab |
30023133201323 has 4 divisors (see below), whose sum is σ = 30196677324048. Its totient is φ = 29849589078600.
The previous prime is 30023133201301. The next prime is 30023133201379. The reversal of 30023133201323 is 32310233132003.
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 30023133201323 - 210 = 30023133200299 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30023133201292 and 30023133201301.
It is not an unprimeable number, because it can be changed into a prime (30023933201323) 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, 86772061103 + ... + 86772061448.
It is an arithmetic number, because the mean of its divisors is an integer number (7549169331012).
Almost surely, 230023133201323 is an apocalyptic number.
30023133201323 is a deficient number, since it is larger than the sum of its proper divisors (173544122725).
30023133201323 is a wasteful number, since it uses less digits than its factorization.
30023133201323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173544122724.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 30023133201323 its reverse (32310233132003), we get a palindrome (62333366333326).
The spelling of 30023133201323 in words is "thirty trillion, twenty-three billion, one hundred thirty-three million, two hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •