Base | Representation |
---|---|
bin | 1101101001110010001110… |
… | …00010000001010110110111 |
3 | 10221022011122101220221021211 |
4 | 12310321013002001112313 |
5 | 12413344112324024343 |
6 | 143504214250022251 |
7 | 6216043152534016 |
oct | 664710702012667 |
9 | 127264571827254 |
10 | 30023013111223 |
11 | 9625763226140 |
12 | 344a7b2417987 |
13 | 139a20913c122 |
14 | 75b19b8cca7d |
15 | 370e7a32879d |
hex | 1b4e470815b7 |
30023013111223 has 4 divisors (see below), whose sum is σ = 32752377939528. Its totient is φ = 27293648282920.
The previous prime is 30023013111187. The next prime is 30023013111253. The reversal of 30023013111223 is 32211131032003.
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 30023013111223 - 229 = 30022476240311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30023013111194 and 30023013111203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30023013111253) 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, 1364682414136 + ... + 1364682414157.
It is an arithmetic number, because the mean of its divisors is an integer number (8188094484882).
Almost surely, 230023013111223 is an apocalyptic number.
30023013111223 is a deficient number, since it is larger than the sum of its proper divisors (2729364828305).
30023013111223 is a wasteful number, since it uses less digits than its factorization.
30023013111223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2729364828304.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30023013111223 its reverse (32211131032003), we get a palindrome (62234144143226).
The spelling of 30023013111223 in words is "thirty trillion, twenty-three billion, thirteen million, one hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •