Base | Representation |
---|---|
bin | 10010110110101011… |
… | …11110011011101101 |
3 | 222010110010022112102 |
4 | 21123111332123231 |
5 | 131212320000442 |
6 | 4352234344445 |
7 | 505562111252 |
oct | 113325763355 |
9 | 28113108472 |
10 | 10122421997 |
11 | 4324930516 |
12 | 1b65b8b125 |
13 | c5418191c |
14 | 6c050d429 |
15 | 3e39e1232 |
hex | 25b57e6ed |
10122421997 has 2 divisors, whose sum is σ = 10122421998. Its totient is φ = 10122421996.
The previous prime is 10122421987. The next prime is 10122422029. The reversal of 10122421997 is 79912422101.
10122421997 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6993809641 + 3128612356 = 83629^2 + 55934^2 .
It is an emirp because it is prime and its reverse (79912422101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122421997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10122421997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10122421937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061210998 + 5061210999.
It is an arithmetic number, because the mean of its divisors is an integer number (5061210999).
Almost surely, 210122421997 is an apocalyptic number.
It is an amenable number.
10122421997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122421997 is an equidigital number, since it uses as much as digits as its factorization.
10122421997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18144, while the sum is 38.
The spelling of 10122421997 in words is "ten billion, one hundred twenty-two million, four hundred twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •