Base | Representation |
---|---|
bin | 1101101111100001001011… |
… | …00100100010110001000001 |
3 | 10222000000011011120120021012 |
4 | 12313300211210202301001 |
5 | 12430111100134344413 |
6 | 144134515144210305 |
7 | 6236216162451260 |
oct | 667604544426101 |
9 | 128000134516235 |
10 | 30220020231233 |
11 | 96a126964a2a8 |
12 | 3480a13769995 |
13 | 13b297439a7a1 |
14 | 76692a2dc5d7 |
15 | 37615ab637a8 |
hex | 1b7c25922c41 |
30220020231233 has 16 divisors (see below), whose sum is σ = 34862225883264. Its totient is φ = 25659111260160.
The previous prime is 30220020231221. The next prime is 30220020231281. The reversal of 30220020231233 is 33213202002203.
It is not a de Polignac number, because 30220020231233 - 24 = 30220020231217 is a prime.
It is a super-2 number, since 2×302200202312332 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30220020231199 and 30220020231208.
It is not an unprimeable number, because it can be changed into a prime (30220020231133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10192091 + ... + 12818687.
It is an arithmetic number, because the mean of its divisors is an integer number (2178889117704).
Almost surely, 230220020231233 is an apocalyptic number.
It is an amenable number.
30220020231233 is a deficient number, since it is larger than the sum of its proper divisors (4642205652031).
30220020231233 is a wasteful number, since it uses less digits than its factorization.
30220020231233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2642072.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 30220020231233 its reverse (33213202002203), we get a palindrome (63433222233436).
The spelling of 30220020231233 in words is "thirty trillion, two hundred twenty billion, twenty million, two hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •