Base | Representation |
---|---|
bin | 11101000100111011… |
… | …011101111111110010 |
3 | 2222120212012212002200 |
4 | 131010323131333302 |
5 | 1002420112223442 |
6 | 22202014524030 |
7 | 2153455626063 |
oct | 350473357762 |
9 | 88525185080 |
10 | 31221211122 |
11 | 12271618022 |
12 | 6073b06616 |
13 | 2c373a502a |
14 | 17226da56a |
15 | c2ae5434c |
hex | 744eddff2 |
31221211122 has 24 divisors (see below), whose sum is σ = 71206271760. Its totient is φ = 9859329720.
The previous prime is 31221211097. The next prime is 31221211139. The reversal of 31221211122 is 22111212213.
31221211122 is a `hidden beast` number, since 312 + 21 + 211 + 122 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 31221211095 and 31221211104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45644704 + ... + 45645387.
It is an arithmetic number, because the mean of its divisors is an integer number (2966927990).
Almost surely, 231221211122 is an apocalyptic number.
31221211122 is an abundant number, since it is smaller than the sum of its proper divisors (39985060638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31221211122 is a wasteful number, since it uses less digits than its factorization.
31221211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91290118 (or 91290115 counting only the distinct ones).
The product of its digits is 96, while the sum is 18.
Adding to 31221211122 its reverse (22111212213), we get a palindrome (53332423335).
The spelling of 31221211122 in words is "thirty-one billion, two hundred twenty-one million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •