Base | Representation |
---|---|
bin | 1001000011010101111… |
… | …00111110000011011110 |
3 | 1002201211100121100121000 |
4 | 10201222330332003132 |
5 | 20043443143404042 |
6 | 354515223251130 |
7 | 31320443326533 |
oct | 4415274760336 |
9 | 1081740540530 |
10 | 311032013022 |
11 | 10a9a950aa35 |
12 | 50343ba9aa6 |
13 | 2343a584573 |
14 | 110a8386d8a |
15 | 8155e7374c |
hex | 486af3e0de |
311032013022 has 32 divisors (see below), whose sum is σ = 731840032800. Its totient is φ = 97578670464.
The previous prime is 311032013021. The next prime is 311032013059. The reversal of 311032013022 is 220310230113.
311032013022 is a `hidden beast` number, since 31 + 10 + 320 + 1 + 302 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 311032012986 and 311032013004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311032013021) 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, 169406497 + ... + 169408332.
It is an arithmetic number, because the mean of its divisors is an integer number (22870001025).
Almost surely, 2311032013022 is an apocalyptic number.
311032013022 is an abundant number, since it is smaller than the sum of its proper divisors (420808019778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
311032013022 is a wasteful number, since it uses less digits than its factorization.
311032013022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338814857 (or 338814851 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 311032013022 its reverse (220310230113), we get a palindrome (531342243135).
The spelling of 311032013022 in words is "three hundred eleven billion, thirty-two million, thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •