Base | Representation |
---|---|
bin | 11101101110001001101… |
… | …11110011001011001101 |
3 | 10121121220220011210011012 |
4 | 32313010313303023031 |
5 | 113212414303223041 |
6 | 2101045410535005 |
7 | 133531353366650 |
oct | 16670467631315 |
9 | 3547826153135 |
10 | 1021210211021 |
11 | 3641025a5410 |
12 | 145b01297465 |
13 | 753b8601570 |
14 | 375d9359897 |
15 | 1b86d8883eb |
hex | edc4df32cd |
1021210211021 has 16 divisors (see below), whose sum is σ = 1371135389568. Its totient is φ = 734536814400.
The previous prime is 1021210210987. The next prime is 1021210211023. The reversal of 1021210211021 is 1201120121201.
It is a cyclic number.
It is not a de Polignac number, because 1021210211021 - 26 = 1021210210957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021210210987 and 1021210211005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021210211023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 510094010 + ... + 510096011.
It is an arithmetic number, because the mean of its divisors is an integer number (85695961848).
Almost surely, 21021210211021 is an apocalyptic number.
1021210211021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1021210211021 is a deficient number, since it is larger than the sum of its proper divisors (349925178547).
1021210211021 is a wasteful number, since it uses less digits than its factorization.
1021210211021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1020190052.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1021210211021 its reverse (1201120121201), we get a palindrome (2222330332222).
The spelling of 1021210211021 in words is "one trillion, twenty-one billion, two hundred ten million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •