Base | Representation |
---|---|
bin | 11100001000101110… |
… | …010000000100000110 |
3 | 2212222110112120021100 |
4 | 130020232100010012 |
5 | 443333021110342 |
6 | 21513453000530 |
7 | 2116442140203 |
oct | 341056200406 |
9 | 85873476240 |
10 | 30211113222 |
11 | 118a3427574 |
12 | 5a31783146 |
13 | 2b06040874 |
14 | 16684c0caa |
15 | bbc42ae4c |
hex | 708b90106 |
30211113222 has 12 divisors (see below), whose sum is σ = 65457412020. Its totient is φ = 10070371068.
The previous prime is 30211113217. The next prime is 30211113241. The reversal of 30211113222 is 22231111203.
It is a super-2 number, since 2×302111132222 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1678395179 = 30211113222 / (3 + 0 + 2 + 1 + 1 + 1 + 1 + 3 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 30211113195 and 30211113204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 839197572 + ... + 839197607.
It is an arithmetic number, because the mean of its divisors is an integer number (5454784335).
Almost surely, 230211113222 is an apocalyptic number.
30211113222 is an abundant number, since it is smaller than the sum of its proper divisors (35246298798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30211113222 is a wasteful number, since it uses less digits than its factorization.
30211113222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1678395187 (or 1678395184 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 30211113222 its reverse (22231111203), we get a palindrome (52442224425).
The spelling of 30211113222 in words is "thirty billion, two hundred eleven million, one hundred thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •