Base | Representation |
---|---|
bin | 1101101001001011011111… |
… | …01111010000100101000101 |
3 | 10221020011222101022112112111 |
4 | 12310211233233100211011 |
5 | 12413024022113102323 |
6 | 143450455151421021 |
7 | 6214406003434552 |
oct | 664455757204505 |
9 | 127204871275474 |
10 | 30002221222213 |
11 | 96179637a6199 |
12 | 344676b224771 |
13 | 1398274691416 |
14 | 75a18838da29 |
15 | 37065ecd8c0d |
hex | 1b496fbd0945 |
30002221222213 has 4 divisors (see below), whose sum is σ = 30112930525888. Its totient is φ = 29891511918540.
The previous prime is 30002221222199. The next prime is 30002221222223. The reversal of 30002221222213 is 31222212220003.
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 a de Polignac number, because none of the positive numbers 2k-30002221222213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30002221222223) 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, 55354651431 + ... + 55354651972.
It is an arithmetic number, because the mean of its divisors is an integer number (7528232631472).
Almost surely, 230002221222213 is an apocalyptic number.
It is an amenable number.
30002221222213 is a deficient number, since it is larger than the sum of its proper divisors (110709303675).
30002221222213 is a wasteful number, since it uses less digits than its factorization.
30002221222213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110709303674.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 30002221222213 its reverse (31222212220003), we get a palindrome (61224433442216).
The spelling of 30002221222213 in words is "thirty trillion, two billion, two hundred twenty-one million, two hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •