Base | Representation |
---|---|
bin | 1000101110110010110… |
… | …10000001101110010101 |
3 | 1001200100112100022102002 |
4 | 10113121122001232111 |
5 | 14403400024101401 |
6 | 345452421525045 |
7 | 30450166546016 |
oct | 4273132015625 |
9 | 1050315308362 |
10 | 300000222101 |
11 | 106258339158 |
12 | 4a185573785 |
13 | 2239cba8a28 |
14 | 1073d19d00d |
15 | 7c0c704a6b |
hex | 45d9681b95 |
300000222101 has 2 divisors, whose sum is σ = 300000222102. Its totient is φ = 300000222100.
The previous prime is 300000222083. The next prime is 300000222121. The reversal of 300000222101 is 101222000003.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 220642515076 + 79357707025 = 469726^2 + 281705^2 .
It is an emirp because it is prime and its reverse (101222000003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 300000222101 - 222 = 299996027797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300000222121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150000111050 + 150000111051.
It is an arithmetic number, because the mean of its divisors is an integer number (150000111051).
Almost surely, 2300000222101 is an apocalyptic number.
It is an amenable number.
300000222101 is a deficient number, since it is larger than the sum of its proper divisors (1).
300000222101 is an equidigital number, since it uses as much as digits as its factorization.
300000222101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 300000222101 its reverse (101222000003), we get a palindrome (401222222104).
The spelling of 300000222101 in words is "three hundred billion, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •