Base | Representation |
---|---|
bin | 1001010010011111100011… |
… | …0010011011010101001110 |
3 | 1100011101100012221112212211 |
4 | 2110213320302123111032 |
5 | 2314313330133400220 |
6 | 33415532545021034 |
7 | 2102613242033665 |
oct | 224477062332516 |
9 | 40141305845784 |
10 | 10213311231310 |
11 | 3288493a25330 |
12 | 118b4a932477a |
13 | 59115a17a315 |
14 | 274481033ddc |
15 | 12aa11ce5b5a |
hex | 949f8c9b54e |
10213311231310 has 32 divisors (see below), whose sum is σ = 20055368835072. Its totient is φ = 3713905522080.
The previous prime is 10213311231293. The next prime is 10213311231359. The reversal of 10213311231310 is 1313211331201.
It is a super-2 number, since 2×102133112313102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23543187 + ... + 23973073.
It is an arithmetic number, because the mean of its divisors is an integer number (626730276096).
Almost surely, 210213311231310 is an apocalyptic number.
10213311231310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10213311231310 is a deficient number, since it is larger than the sum of its proper divisors (9842057603762).
10213311231310 is a wasteful number, since it uses less digits than its factorization.
10213311231310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645888.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10213311231310 its reverse (1313211331201), we get a palindrome (11526522562511).
The spelling of 10213311231310 in words is "ten trillion, two hundred thirteen billion, three hundred eleven million, two hundred thirty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •