Base | Representation |
---|---|
bin | 10010101001010011… |
… | …00100111110111001 |
3 | 221211121210210022200 |
4 | 21110221210332321 |
5 | 131000042320441 |
6 | 4333143340413 |
7 | 503026421451 |
oct | 112451447671 |
9 | 27747723280 |
10 | 10010120121 |
11 | 42774a7451 |
12 | 1b34451709 |
13 | c36b21901 |
14 | 6ad638d61 |
15 | 3d8c0b7b6 |
hex | 254a64fb9 |
10010120121 has 6 divisors (see below), whose sum is σ = 14459062410. Its totient is φ = 6673413408.
The previous prime is 10010120063. The next prime is 10010120129. The reversal of 10010120121 is 12102101001.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 8396973225 + 1613146896 = 91635^2 + 40164^2 .
It is not a de Polignac number, because 10010120121 - 211 = 10010118073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1112235569 = 10010120121 / (1 + 0 + 0 + 1 + 0 + 1 + 2 + 0 + 1 + 2 + 1).
It is not an unprimeable number, because it can be changed into a prime (10010120129) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 556117776 + ... + 556117793.
It is an arithmetic number, because the mean of its divisors is an integer number (2409843735).
Almost surely, 210010120121 is an apocalyptic number.
It is an amenable number.
10010120121 is a deficient number, since it is larger than the sum of its proper divisors (4448942289).
10010120121 is a wasteful number, since it uses less digits than its factorization.
10010120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1112235575 (or 1112235572 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10010120121 its reverse (12102101001), we get a palindrome (22112221122).
The spelling of 10010120121 in words is "ten billion, ten million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •