Base | Representation |
---|---|
bin | 11100001110000101… |
… | …100001110010011101 |
3 | 2220012201212102120220 |
4 | 130032011201302131 |
5 | 444024040214323 |
6 | 21530425431553 |
7 | 2121614052645 |
oct | 341605416235 |
9 | 86181772526 |
10 | 30301101213 |
11 | 1193a1aa909 |
12 | 5a5793b5b9 |
13 | 2b1b88a1b6 |
14 | 1676427525 |
15 | bc52a40e3 |
hex | 70e161c9d |
30301101213 has 4 divisors (see below), whose sum is σ = 40401468288. Its totient is φ = 20200734140.
The previous prime is 30301101199. The next prime is 30301101217. The reversal of 30301101213 is 31210110303.
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 30301101213 - 29 = 30301100701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30301101192 and 30301101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30301101217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5050183533 + ... + 5050183538.
It is an arithmetic number, because the mean of its divisors is an integer number (10100367072).
Almost surely, 230301101213 is an apocalyptic number.
It is an amenable number.
30301101213 is a deficient number, since it is larger than the sum of its proper divisors (10100367075).
30301101213 is a wasteful number, since it uses less digits than its factorization.
30301101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10100367074.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 30301101213 its reverse (31210110303), we get a palindrome (61511211516).
The spelling of 30301101213 in words is "thirty billion, three hundred one million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •