Base | Representation |
---|---|
bin | 11101101110001001110… |
… | …10111000101110110100 |
3 | 10121121220221200220011020 |
4 | 32313010322320232310 |
5 | 113212420010121322 |
6 | 2101045440141140 |
7 | 133531363310055 |
oct | 16670472705664 |
9 | 3547827626136 |
10 | 1021211020212 |
11 | 364102aa8369 |
12 | 145b016077b0 |
13 | 753b8825986 |
14 | 375d94ca72c |
15 | 1b86d99805c |
hex | edc4eb8bb4 |
1021211020212 has 24 divisors (see below), whose sum is σ = 2382842095200. Its totient is φ = 340401333216.
The previous prime is 1021211020157. The next prime is 1021211020229. The reversal of 1021211020212 is 2120201121201.
It is a junction number, because it is equal to n+sod(n) for n = 1021211020191 and 1021211020200.
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 7 ways as a sum of consecutive naturals, for example, 3093214 + ... + 3407402.
It is an arithmetic number, because the mean of its divisors is an integer number (99285087300).
Almost surely, 21021211020212 is an apocalyptic number.
1021211020212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1021211020212 is an abundant number, since it is smaller than the sum of its proper divisors (1361631074988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021211020212 is a wasteful number, since it uses less digits than its factorization.
1021211020212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585055 (or 585053 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1021211020212 its reverse (2120201121201), we get a palindrome (3141412141413).
The spelling of 1021211020212 in words is "one trillion, twenty-one billion, two hundred eleven million, twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •