Base | Representation |
---|---|
bin | 1001010010011111001011… |
… | …0001000010011111010001 |
3 | 1100011101002011211211121210 |
4 | 2110213302301002133101 |
5 | 2314313123303012423 |
6 | 33415514535410333 |
7 | 2102610604233030 |
oct | 224476261023721 |
9 | 40141064754553 |
10 | 10213210204113 |
11 | 32884419a2084 |
12 | 118b47b5239a9 |
13 | 591142267107 |
14 | 274471856717 |
15 | 12aa07edbb93 |
hex | 949f2c427d1 |
10213210204113 has 32 divisors (see below), whose sum is σ = 15645282831360. Its totient is φ = 5805305922240.
The previous prime is 10213210204073. The next prime is 10213210204129. The reversal of 10213210204113 is 31140201231201.
It is not a de Polignac number, because 10213210204113 - 213 = 10213210195921 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10213210204113.
It is not an unprimeable number, because it can be changed into a prime (10213210284113) 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, 4273306 + ... + 6219932.
It is an arithmetic number, because the mean of its divisors is an integer number (488915088480).
Almost surely, 210213210204113 is an apocalyptic number.
It is an amenable number.
10213210204113 is a deficient number, since it is larger than the sum of its proper divisors (5432072627247).
10213210204113 is a wasteful number, since it uses less digits than its factorization.
10213210204113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1947957.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 10213210204113 its reverse (31140201231201), we get a palindrome (41353411435314).
The spelling of 10213210204113 in words is "ten trillion, two hundred thirteen billion, two hundred ten million, two hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •