Base | Representation |
---|---|
bin | 1000101111000000010… |
… | …01000000111110110001 |
3 | 1001200122101221100020022 |
4 | 10113200021000332301 |
5 | 14404112434444441 |
6 | 345511535253225 |
7 | 30453041064524 |
oct | 4274011007661 |
9 | 1050571840208 |
10 | 300113203121 |
11 | 1063060964a6 |
12 | 4a1b737a215 |
13 | 223ba415bc4 |
14 | 107501acbbb |
15 | 7c175c084b |
hex | 45e0240fb1 |
300113203121 has 4 divisors (see below), whose sum is σ = 300160854000. Its totient is φ = 300065552244.
The previous prime is 300113203111. The next prime is 300113203129. The reversal of 300113203121 is 121302311003.
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 300113203121 - 218 = 300112940977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 300113203121.
It is not an unprimeable number, because it can be changed into a prime (300113203129) 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, 23815991 + ... + 23828588.
It is an arithmetic number, because the mean of its divisors is an integer number (75040213500).
Almost surely, 2300113203121 is an apocalyptic number.
It is an amenable number.
300113203121 is a deficient number, since it is larger than the sum of its proper divisors (47650879).
300113203121 is an equidigital number, since it uses as much as digits as its factorization.
300113203121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47650878.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 300113203121 its reverse (121302311003), we get a palindrome (421415514124).
The spelling of 300113203121 in words is "three hundred billion, one hundred thirteen million, two hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •