Base | Representation |
---|---|
bin | 1001010010011111001000… |
… | …1010001000000011101111 |
3 | 1100011101001110122120202022 |
4 | 2110213302022020003233 |
5 | 2314313113200101221 |
6 | 33415513533020355 |
7 | 2102610421436054 |
oct | 224476212100357 |
9 | 40141043576668 |
10 | 10213200003311 |
11 | 3288437165068 |
12 | 118b4780246bb |
13 | 591140105036 |
14 | 27447035d02b |
15 | 12aa071744ab |
hex | 949f22880ef |
10213200003311 has 48 divisors (see below), whose sum is σ = 11903409829440. Its totient is φ = 8731898757120.
The previous prime is 10213200003269. The next prime is 10213200003323. The reversal of 10213200003311 is 11330000231201.
It is not a de Polignac number, because 10213200003311 - 26 = 10213200003247 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10213200003311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213200003371) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11324255 + ... + 12192831.
It is an arithmetic number, because the mean of its divisors is an integer number (247987704780).
Almost surely, 210213200003311 is an apocalyptic number.
10213200003311 is a deficient number, since it is larger than the sum of its proper divisors (1690209826129).
10213200003311 is a wasteful number, since it uses less digits than its factorization.
10213200003311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 868724 (or 868707 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10213200003311 its reverse (11330000231201), we get a palindrome (21543200234512).
The spelling of 10213200003311 in words is "ten trillion, two hundred thirteen billion, two hundred million, three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •