Base | Representation |
---|---|
bin | 1001000001110100001… |
… | …01010111100100101000 |
3 | 1002122201012212001001100 |
4 | 10200322011113210220 |
5 | 20040303301143422 |
6 | 354302014321400 |
7 | 31261226415342 |
oct | 4407205274450 |
9 | 1078635761040 |
10 | 310212131112 |
11 | 10a61872a584 |
12 | 501554b9260 |
13 | 2333975cc40 |
14 | 1102b524292 |
15 | 8108ec07ac |
hex | 483a157928 |
310212131112 has 48 divisors (see below), whose sum is σ = 904785385140. Its totient is φ = 95449886208.
The previous prime is 310212131077. The next prime is 310212131147. The reversal of 310212131112 is 211131212013.
310212131112 is a `hidden beast` number, since 310 + 21 + 21 + 311 + 1 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (310212131077) and next prime (310212131147).
It can be written as a sum of positive squares in 2 ways, for example, as 310086377316 + 125753796 = 556854^2 + 11214^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 165710673 + ... + 165712544.
Almost surely, 2310212131112 is an apocalyptic number.
It is an amenable number.
310212131112 is an abundant number, since it is smaller than the sum of its proper divisors (594573254028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
310212131112 is a wasteful number, since it uses less digits than its factorization.
310212131112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 331423242 (or 331423235 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 310212131112 its reverse (211131212013), we get a palindrome (521343343125).
The spelling of 310212131112 in words is "three hundred ten billion, two hundred twelve million, one hundred thirty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •