Base | Representation |
---|---|
bin | 1101101100011010000010… |
… | …10110000011010011100001 |
3 | 10221121210012112220022202221 |
4 | 12312031001112003103201 |
5 | 12421333123133341001 |
6 | 144013434522111041 |
7 | 6225412662544024 |
oct | 666150126032341 |
9 | 127553175808687 |
10 | 30113112012001 |
11 | 965a998757907 |
12 | 346415834b481 |
13 | 13a58675ab775 |
14 | 7616a79b31bb |
15 | 3734a01de1a1 |
hex | 1b63415834e1 |
30113112012001 has 4 divisors (see below), whose sum is σ = 30148005537792. Its totient is φ = 30078218486212.
The previous prime is 30113112011999. The next prime is 30113112012013. The reversal of 30113112012001 is 10021021131103.
It is a happy number.
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 30113112012001 - 21 = 30113112011999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30113112012301) 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, 17446761601 + ... + 17446763326.
It is an arithmetic number, because the mean of its divisors is an integer number (7537001384448).
Almost surely, 230113112012001 is an apocalyptic number.
It is an amenable number.
30113112012001 is a deficient number, since it is larger than the sum of its proper divisors (34893525791).
30113112012001 is an equidigital number, since it uses as much as digits as its factorization.
30113112012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34893525790.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 30113112012001 its reverse (10021021131103), we get a palindrome (40134133143104).
The spelling of 30113112012001 in words is "thirty trillion, one hundred thirteen billion, one hundred twelve million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •