Base | Representation |
---|---|
bin | 100111000111111111… |
… | …100011000000100001 |
3 | 11000102202021122110020 |
4 | 213013333203000201 |
5 | 1142014031430423 |
6 | 31144340424053 |
7 | 3015022235622 |
oct | 470777430041 |
9 | 130382248406 |
10 | 42010030113 |
11 | 168a8626457 |
12 | 81850a8029 |
13 | 3c6662c0ac |
14 | 2067517a49 |
15 | 115d1cb4e3 |
hex | 9c7fe3021 |
42010030113 has 4 divisors (see below), whose sum is σ = 56013373488. Its totient is φ = 28006686740.
The previous prime is 42010030099. The next prime is 42010030157. The reversal of 42010030113 is 31103001024.
42010030113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 42010030113 - 29 = 42010029601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42010030092 and 42010030101.
It is not an unprimeable number, because it can be changed into a prime (42010030813) 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, 7001671683 + ... + 7001671688.
It is an arithmetic number, because the mean of its divisors is an integer number (14003343372).
Almost surely, 242010030113 is an apocalyptic number.
It is an amenable number.
42010030113 is a deficient number, since it is larger than the sum of its proper divisors (14003343375).
42010030113 is a wasteful number, since it uses less digits than its factorization.
42010030113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14003343374.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 42010030113 its reverse (31103001024), we get a palindrome (73113031137).
The spelling of 42010030113 in words is "forty-two billion, ten million, thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •