Base | Representation |
---|---|
bin | 10010101010111101… |
… | …11010000100010001 |
3 | 221212121010001021011 |
4 | 21111132322010101 |
5 | 131012132200423 |
6 | 4334403130521 |
7 | 503256305446 |
oct | 112536720421 |
9 | 27777101234 |
10 | 10024100113 |
11 | 4284385865 |
12 | 1b39073a41 |
13 | c399a7bb1 |
14 | 6b14379cd |
15 | 3da06db0d |
hex | 2557ba111 |
10024100113 has 4 divisors (see below), whose sum is σ = 10027354608. Its totient is φ = 10020845620.
The previous prime is 10024100083. The next prime is 10024100159. The reversal of 10024100113 is 31100142001.
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 a cyclic number.
It is not a de Polignac number, because 10024100113 - 25 = 10024100081 is a prime.
It is a super-2 number, since 2×100241001132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10024100093 and 10024100102.
It is not an unprimeable number, because it can be changed into a prime (10024100213) 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, 1622623 + ... + 1628788.
It is an arithmetic number, because the mean of its divisors is an integer number (2506838652).
Almost surely, 210024100113 is an apocalyptic number.
It is an amenable number.
10024100113 is a deficient number, since it is larger than the sum of its proper divisors (3254495).
10024100113 is an equidigital number, since it uses as much as digits as its factorization.
10024100113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3254494.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10024100113 its reverse (31100142001), we get a palindrome (41124242114).
The spelling of 10024100113 in words is "ten billion, twenty-four million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •