Base | Representation |
---|---|
bin | 10011001101000011… |
… | …11111011000111101 |
3 | 222121112022102012010 |
4 | 21212201333120331 |
5 | 132103342333041 |
6 | 4423021401433 |
7 | 513331403604 |
oct | 114641773075 |
9 | 28545272163 |
10 | 10310121021 |
11 | 4410881582 |
12 | 1bb8a09279 |
13 | c8401cc35 |
14 | 6db40ca3b |
15 | 40521aa16 |
hex | 26687f63d |
10310121021 has 4 divisors (see below), whose sum is σ = 13746828032. Its totient is φ = 6873414012.
The previous prime is 10310121011. The next prime is 10310121023. The reversal of 10310121021 is 12012101301.
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: 12012101301 = 3 ⋅4004033767.
It is not a de Polignac number, because 10310121021 - 27 = 10310120893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10310120988 and 10310121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310121023) 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, 1718353501 + ... + 1718353506.
It is an arithmetic number, because the mean of its divisors is an integer number (3436707008).
Almost surely, 210310121021 is an apocalyptic number.
It is an amenable number.
10310121021 is a deficient number, since it is larger than the sum of its proper divisors (3436707011).
10310121021 is an equidigital number, since it uses as much as digits as its factorization.
10310121021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3436707010.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10310121021 its reverse (12012101301), we get a palindrome (22322222322).
The spelling of 10310121021 in words is "ten billion, three hundred ten million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •