Base | Representation |
---|---|
bin | 11100111000111100… |
… | …110000011100000101 |
3 | 2222001212000120011000 |
4 | 130320330300130011 |
5 | 1002012134102323 |
6 | 22130035003513 |
7 | 2145465352431 |
oct | 347074603405 |
9 | 88055016130 |
10 | 31020222213 |
11 | 1217911a092 |
12 | 6018739599 |
13 | 2c04862896 |
14 | 1703b3b9c1 |
15 | c184a1e43 |
hex | 738f30705 |
31020222213 has 32 divisors (see below), whose sum is σ = 47171980800. Its totient is φ = 20139624000.
The previous prime is 31020222203. The next prime is 31020222251. The reversal of 31020222213 is 31222202013.
It is not a de Polignac number, because 31020222213 - 214 = 31020205829 is a prime.
It is a super-2 number, since 2×310202222132 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31020222203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73108 + ... + 259586.
It is an arithmetic number, because the mean of its divisors is an integer number (1474124400).
Almost surely, 231020222213 is an apocalyptic number.
It is an amenable number.
31020222213 is a deficient number, since it is larger than the sum of its proper divisors (16151758587).
31020222213 is a wasteful number, since it uses less digits than its factorization.
31020222213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186650 (or 186644 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 31020222213 its reverse (31222202013), we get a palindrome (62242424226).
It can be divided in two parts, 3102022 and 2213, that multiplied together give a palindrome (6864774686).
The spelling of 31020222213 in words is "thirty-one billion, twenty million, two hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •