Base | Representation |
---|---|
bin | 1101101001110010100111… |
… | …00011011111100100100011 |
3 | 10221022012012001021011211001 |
4 | 12310321103203133210203 |
5 | 12413400030120243243 |
6 | 143504251153132431 |
7 | 6216051313421455 |
oct | 664712343374443 |
9 | 127265161234731 |
10 | 30023223212323 |
11 | 9625860888210 |
12 | 344a85085a117 |
13 | 139a240821cc3 |
14 | 75b1bb7802d5 |
15 | 370e8d9caa4d |
hex | 1b4e538df923 |
30023223212323 has 8 divisors (see below), whose sum is σ = 32752703932416. Its totient is φ = 27293758624200.
The previous prime is 30023223212273. The next prime is 30023223212329. The reversal of 30023223212323 is 32321232232003.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30023223212323 - 29 = 30023223211811 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30023223212291 and 30023223212300.
It is not an unprimeable number, because it can be changed into a prime (30023223212329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36990 + ... + 7749052.
It is an arithmetic number, because the mean of its divisors is an integer number (4094087991552).
Almost surely, 230023223212323 is an apocalyptic number.
30023223212323 is a deficient number, since it is larger than the sum of its proper divisors (2729480720093).
30023223212323 is a wasteful number, since it uses less digits than its factorization.
30023223212323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8065985.
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 30023223212323 its reverse (32321232232003), we get a palindrome (62344455444326).
The spelling of 30023223212323 in words is "thirty trillion, twenty-three billion, two hundred twenty-three million, two hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •