Base | Representation |
---|---|
bin | 11101011001011101100… |
… | …01110000111100010101 |
3 | 10120120020202022212222010 |
4 | 32230232301300330111 |
5 | 113022142120041041 |
6 | 2052011241454433 |
7 | 132656162200452 |
oct | 16545661607425 |
9 | 3516222285863 |
10 | 1010102112021 |
11 | 35a422344202 |
12 | 1439211a1419 |
13 | 74338188c12 |
14 | 36c63d8a829 |
15 | 1b41d594a16 |
hex | eb2ec70f15 |
1010102112021 has 4 divisors (see below), whose sum is σ = 1346802816032. Its totient is φ = 673401408012.
The previous prime is 1010102112017. The next prime is 1010102112031. The reversal of 1010102112021 is 1202112010101.
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 not a de Polignac number, because 1010102112021 - 22 = 1010102112017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010102111988 and 1010102112006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010102112031) 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, 168350352001 + ... + 168350352006.
It is an arithmetic number, because the mean of its divisors is an integer number (336700704008).
Almost surely, 21010102112021 is an apocalyptic number.
It is an amenable number.
1010102112021 is a deficient number, since it is larger than the sum of its proper divisors (336700704011).
1010102112021 is an equidigital number, since it uses as much as digits as its factorization.
1010102112021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 336700704010.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1010102112021 its reverse (1202112010101), we get a palindrome (2212214122122).
The spelling of 1010102112021 in words is "one trillion, ten billion, one hundred two million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •