Base | Representation |
---|---|
bin | 1101101001011111111110… |
… | …11001010001011001011101 |
3 | 10221021020100222221000001210 |
4 | 12310233333121101121131 |
5 | 12413214034123441333 |
6 | 143455514501455033 |
7 | 6215245413603465 |
oct | 664577731213135 |
9 | 127236328830053 |
10 | 30013221312093 |
11 | 9621598a95568 |
12 | 344891b111479 |
13 | 139930861a946 |
14 | 75a90d284ba5 |
15 | 370aa5894a63 |
hex | 1b4bff65165d |
30013221312093 has 8 divisors (see below), whose sum is σ = 40017655108800. Its totient is φ = 20008800861728.
The previous prime is 30013221312079. The next prime is 30013221312121. The reversal of 30013221312093 is 39021312231003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30013221312093 - 24 = 30013221312077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30013221312093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30013221312073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4623568 + ... + 9022406.
It is an arithmetic number, because the mean of its divisors is an integer number (5002206888600).
Almost surely, 230013221312093 is an apocalyptic number.
It is an amenable number.
30013221312093 is a deficient number, since it is larger than the sum of its proper divisors (10004433796707).
30013221312093 is a wasteful number, since it uses less digits than its factorization.
30013221312093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6673171.
The product of its (nonzero) digits is 5832, while the sum is 30.
Adding to 30013221312093 its reverse (39021312231003), we get a palindrome (69034533543096).
The spelling of 30013221312093 in words is "thirty trillion, thirteen billion, two hundred twenty-one million, three hundred twelve thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •