Base | Representation |
---|---|
bin | 10010110110100001… |
… | …00110001100110101 |
3 | 222010100110200102002 |
4 | 21123100212030311 |
5 | 131211434341041 |
6 | 4352144225045 |
7 | 505544116451 |
oct | 113320461465 |
9 | 28110420362 |
10 | 10121012021 |
11 | 432405814a |
12 | 1b6560b185 |
13 | c53aa9c13 |
14 | 6c0263661 |
15 | 3e381359b |
hex | 25b426335 |
10121012021 has 4 divisors (see below), whose sum is σ = 10132795200. Its totient is φ = 10109228844.
The previous prime is 10121012009. The next prime is 10121012047. The reversal of 10121012021 is 12021012101.
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, and also an emirpimes, since its reverse is a distinct semiprime: 12021012101 = 7 ⋅1717287443.
It is a cyclic number.
It is not a de Polignac number, because 10121012021 - 222 = 10116817717 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10121011993 and 10121012011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121012051) 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, 5890301 + ... + 5892018.
It is an arithmetic number, because the mean of its divisors is an integer number (2533198800).
Almost surely, 210121012021 is an apocalyptic number.
It is an amenable number.
10121012021 is a deficient number, since it is larger than the sum of its proper divisors (11783179).
10121012021 is an equidigital number, since it uses as much as digits as its factorization.
10121012021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11783178.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10121012021 its reverse (12021012101), we get a palindrome (22142024122).
The spelling of 10121012021 in words is "ten billion, one hundred twenty-one million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •