Base | Representation |
---|---|
bin | 1101101001100000001000… |
… | …10001101110101101110111 |
3 | 10221021020120201001102010010 |
4 | 12310300010101232231313 |
5 | 12413214221111033421 |
6 | 143455530545231303 |
7 | 6215250430040340 |
oct | 664600421565567 |
9 | 127236521042103 |
10 | 30013303221111 |
11 | 962163024aa71 |
12 | 3448942632533 |
13 | 139931c598c12 |
14 | 75a91a0c70c7 |
15 | 370aacb74076 |
hex | 1b4c0446eb77 |
30013303221111 has 16 divisors (see below), whose sum is σ = 45735443916800. Its totient is φ = 17150126498208.
The previous prime is 30013303221089. The next prime is 30013303221179. The reversal of 30013303221111 is 11112230331003.
It is a happy number.
It is not a de Polignac number, because 30013303221111 - 25 = 30013303221079 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30013303221511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12742456 + ... + 14912973.
It is an arithmetic number, because the mean of its divisors is an integer number (2858465244800).
Almost surely, 230013303221111 is an apocalyptic number.
30013303221111 is a deficient number, since it is larger than the sum of its proper divisors (15722140695689).
30013303221111 is a wasteful number, since it uses less digits than its factorization.
30013303221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27707118.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 30013303221111 its reverse (11112230331003), we get a palindrome (41125533552114).
The spelling of 30013303221111 in words is "thirty trillion, thirteen billion, three hundred three million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.985 sec. • engine limits •