Base | Representation |
---|---|
bin | 11011111100111010… |
… | …111101111001110001 |
3 | 2212110122222110210020 |
4 | 123330322331321301 |
5 | 442431324320423 |
6 | 21442101154053 |
7 | 2111516211624 |
oct | 337472757161 |
9 | 85418873706 |
10 | 30013120113 |
11 | 118016953a9 |
12 | 59973bb929 |
13 | 2aa4009b92 |
14 | 164a0a1dbb |
15 | ba9d6b4e3 |
hex | 6fcebde71 |
30013120113 has 4 divisors (see below), whose sum is σ = 40017493488. Its totient is φ = 20008746740.
The previous prime is 30013120103. The next prime is 30013120121. The reversal of 30013120113 is 31102131003.
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: 31102131003 = 3 ⋅10367377001.
It is a cyclic number.
It is not a de Polignac number, because 30013120113 - 29 = 30013119601 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30013120092 and 30013120101.
It is not an unprimeable number, because it can be changed into a prime (30013120103) 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, 5002186683 + ... + 5002186688.
It is an arithmetic number, because the mean of its divisors is an integer number (10004373372).
Almost surely, 230013120113 is an apocalyptic number.
It is an amenable number.
30013120113 is a deficient number, since it is larger than the sum of its proper divisors (10004373375).
30013120113 is a wasteful number, since it uses less digits than its factorization.
30013120113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10004373374.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 30013120113 its reverse (31102131003), we get a palindrome (61115251116).
The spelling of 30013120113 in words is "thirty billion, thirteen million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •