Base | Representation |
---|---|
bin | 11101101110001001101… |
… | …11110000110000011001 |
3 | 10121121220220011021120020 |
4 | 32313010313300300121 |
5 | 113212414302413423 |
6 | 2101045410421053 |
7 | 133531353326034 |
oct | 16670467606031 |
9 | 3547826137506 |
10 | 1021210201113 |
11 | 364102598a23 |
12 | 145b01291789 |
13 | 753b85c9bbb |
14 | 375d935601b |
15 | 1b86d8854e3 |
hex | edc4df0c19 |
1021210201113 has 4 divisors (see below), whose sum is σ = 1361613601488. Its totient is φ = 680806800740.
The previous prime is 1021210201073. The next prime is 1021210201171. The reversal of 1021210201113 is 3111020121201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1021210201113 - 212 = 1021210197017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021210201092 and 1021210201101.
It is not an unprimeable number, because it can be changed into a prime (1021210200113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 170201700183 + ... + 170201700188.
It is an arithmetic number, because the mean of its divisors is an integer number (340403400372).
Almost surely, 21021210201113 is an apocalyptic number.
It is an amenable number.
1021210201113 is a deficient number, since it is larger than the sum of its proper divisors (340403400375).
1021210201113 is an equidigital number, since it uses as much as digits as its factorization.
1021210201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340403400374.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1021210201113 its reverse (3111020121201), we get a palindrome (4132230322314).
The spelling of 1021210201113 in words is "one trillion, twenty-one billion, two hundred ten million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •