Base | Representation |
---|---|
bin | 11100001110000001… |
… | …101101111001000011 |
3 | 2220012122222200012211 |
4 | 130032001231321003 |
5 | 444023311232321 |
6 | 21530352202551 |
7 | 2121602422261 |
oct | 341601557103 |
9 | 86178880184 |
10 | 30300102211 |
11 | 11939688295 |
12 | 5a57539457 |
13 | 2b1b5ca582 |
14 | 1676247431 |
15 | bc51580e1 |
hex | 70e06de43 |
30300102211 has 4 divisors (see below), whose sum is σ = 30300572872. Its totient is φ = 30299631552.
The previous prime is 30300102193. The next prime is 30300102223. The reversal of 30300102211 is 11220100303.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11220100303 = 41 ⋅273660983.
It is a cyclic number.
It is not a de Polignac number, because 30300102211 - 25 = 30300102179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30300102191 and 30300102200.
It is not an unprimeable number, because it can be changed into a prime (30300102281) 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, 119886 + ... + 273811.
It is an arithmetic number, because the mean of its divisors is an integer number (7575143218).
Almost surely, 230300102211 is an apocalyptic number.
30300102211 is a deficient number, since it is larger than the sum of its proper divisors (470661).
30300102211 is an equidigital number, since it uses as much as digits as its factorization.
30300102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470660.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 30300102211 its reverse (11220100303), we get a palindrome (41520202514).
The spelling of 30300102211 in words is "thirty billion, three hundred million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •