Base | Representation |
---|---|
bin | 1001010010011110110011… |
… | …0111110101011011000110 |
3 | 1100011100211021210010021210 |
4 | 2110213230313311123012 |
5 | 2314312422444303220 |
6 | 33415501044152250 |
7 | 2102605263605631 |
oct | 224475467653306 |
9 | 40140737703253 |
10 | 10213111322310 |
11 | 32883a10a4786 |
12 | 118b452398686 |
13 | 591127925580 |
14 | 274462676c18 |
15 | 12a9ee4a86e0 |
hex | 949ecdf56c6 |
10213111322310 has 64 divisors (see below), whose sum is σ = 26429514128640. Its totient is φ = 2510896682880.
The previous prime is 10213111322237. The next prime is 10213111322317. The reversal of 10213111322310 is 1322311131201.
It is a super-2 number, since 2×102131113223102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213111322317) 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, 15828880 + ... + 16461459.
It is an arithmetic number, because the mean of its divisors is an integer number (412961158260).
Almost surely, 210213111322310 is an apocalyptic number.
10213111322310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10213111322310 is an abundant number, since it is smaller than the sum of its proper divisors (16216402806330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213111322310 is a wasteful number, since it uses less digits than its factorization.
10213111322310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32291173.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10213111322310 its reverse (1322311131201), we get a palindrome (11535422453511).
The spelling of 10213111322310 in words is "ten trillion, two hundred thirteen billion, one hundred eleven million, three hundred twenty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •