Base | Representation |
---|---|
bin | 11100001001010111… |
… | …110100101010010111 |
3 | 2220000020001020020220 |
4 | 130021113310222113 |
5 | 443343313323111 |
6 | 21514522325423 |
7 | 2116633566222 |
oct | 341127645227 |
9 | 86006036226 |
10 | 30222011031 |
11 | 118a95a0223 |
12 | 5a35359873 |
13 | 2b08387c84 |
14 | 1669b1a5b9 |
15 | bbd37ee06 |
hex | 7095f4a97 |
30222011031 has 8 divisors (see below), whose sum is σ = 40464618240. Its totient is φ = 20063705592.
The previous prime is 30222010993. The next prime is 30222011047. The reversal of 30222011031 is 13011022203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30222011031 - 29 = 30222010519 is a prime.
It is a super-2 number, since 2×302220110312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30222011031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30222011531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21074605 + ... + 21076038.
It is an arithmetic number, because the mean of its divisors is an integer number (5058077280).
Almost surely, 230222011031 is an apocalyptic number.
30222011031 is a deficient number, since it is larger than the sum of its proper divisors (10242607209).
30222011031 is a wasteful number, since it uses less digits than its factorization.
30222011031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42150885.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 30222011031 its reverse (13011022203), we get a palindrome (43233033234).
The spelling of 30222011031 in words is "thirty billion, two hundred twenty-two million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •