Base | Representation |
---|---|
bin | 1001000111011001101… |
… | …01001011110010101110 |
3 | 1002221110012202212211000 |
4 | 10203230311023302232 |
5 | 20112424004311342 |
6 | 355515342541130 |
7 | 31425442442205 |
oct | 4435465136256 |
9 | 1087405685730 |
10 | 313211010222 |
11 | 1109174a4870 |
12 | 508518977a6 |
13 | 236c6b41216 |
14 | 1123391823c |
15 | 82323e244c |
hex | 48ecd4bcae |
313211010222 has 64 divisors (see below), whose sum is σ = 762644678400. Its totient is φ = 94494270240.
The previous prime is 313211010187. The next prime is 313211010223. The reversal of 313211010222 is 222010112313.
It is a super-2 number, since 2×3132110102222 (a number of 24 digits) contains 22 as substring.
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 = 313211010195 and 313211010204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313211010223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1026597 + ... + 1296272.
It is an arithmetic number, because the mean of its divisors is an integer number (11916323100).
Almost surely, 2313211010222 is an apocalyptic number.
313211010222 is an abundant number, since it is smaller than the sum of its proper divisors (449433668178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313211010222 is a wasteful number, since it uses less digits than its factorization.
313211010222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2323118 (or 2323112 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 313211010222 its reverse (222010112313), we get a palindrome (535221122535).
The spelling of 313211010222 in words is "three hundred thirteen billion, two hundred eleven million, ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •