Base | Representation |
---|---|
bin | 11101101110001000100… |
… | …00111000111111001010 |
3 | 10121121220011222120122102 |
4 | 32313010100320333022 |
5 | 113212404200324320 |
6 | 2101044404153402 |
7 | 133531200605621 |
oct | 16670420707712 |
9 | 3547804876572 |
10 | 1021200011210 |
11 | 3640a7869115 |
12 | 145ab9998862 |
13 | 753b646ca82 |
14 | 375d7c626b8 |
15 | 1b86ca21175 |
hex | edc4438fca |
1021200011210 has 64 divisors (see below), whose sum is σ = 1947105578880. Its totient is φ = 384957484800.
The previous prime is 1021200011207. The next prime is 1021200011213. The reversal of 1021200011210 is 121100021201.
It is an interprime number because it is at equal distance from previous prime (1021200011207) and next prime (1021200011213).
It is a junction number, because it is equal to n+sod(n) for n = 1021200011191 and 1021200011200.
It is not an unprimeable number, because it can be changed into a prime (1021200011213) 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, 18590285 + ... + 18645135.
It is an arithmetic number, because the mean of its divisors is an integer number (30423524670).
Almost surely, 21021200011210 is an apocalyptic number.
1021200011210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1021200011210 is a deficient number, since it is larger than the sum of its proper divisors (925905567670).
1021200011210 is a wasteful number, since it uses less digits than its factorization.
1021200011210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56423.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1021200011210 its reverse (121100021201), we get a palindrome (1142300032411).
Subtracting from 1021200011210 its reverse (121100021201), we obtain a palindrome (900099990009).
The spelling of 1021200011210 in words is "one trillion, twenty-one billion, two hundred million, eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •