Base | Representation |
---|---|
bin | 1001000001011100001… |
… | …10111000001011010100 |
3 | 1002122012012202200200011 |
4 | 10200232012320023110 |
5 | 20034400331401322 |
6 | 354230035530004 |
7 | 31253236503100 |
oct | 4405606701324 |
9 | 1078165680604 |
10 | 310011200212 |
11 | 10a52527118a |
12 | 500ba159904 |
13 | 23306c3b00c |
14 | 1100c97c900 |
15 | 80e6530677 |
hex | 482e1b82d4 |
310011200212 has 36 divisors (see below), whose sum is σ = 635700811284. Its totient is φ = 131892136320.
The previous prime is 310011200197. The next prime is 310011200231. The reversal of 310011200212 is 212002110013.
It can be written as a sum of positive squares in 2 ways, for example, as 165279650116 + 144731550096 = 406546^2 + 380436^2 .
It is a super-2 number, since 2×3100112002122 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 310011200192 and 310011200201.
It is a congruent number.
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, 5745739 + ... + 5799442.
It is an arithmetic number, because the mean of its divisors is an integer number (17658355869).
Almost surely, 2310011200212 is an apocalyptic number.
It is an amenable number.
310011200212 is an abundant number, since it is smaller than the sum of its proper divisors (325689611072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
310011200212 is a wasteful number, since it uses less digits than its factorization.
310011200212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11545336 (or 11545327 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 310011200212 its reverse (212002110013), we get a palindrome (522013310225).
The spelling of 310011200212 in words is "three hundred ten billion, eleven million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •