Base | Representation |
---|---|
bin | 1000110000101100100… |
… | …00110000001011011001 |
3 | 1001202222200111102022120 |
4 | 10120112100300023121 |
5 | 14412442411413423 |
6 | 350142013011453 |
7 | 30514404664143 |
oct | 4302620601331 |
9 | 1052880442276 |
10 | 301021201113 |
11 | 106731690866 |
12 | 4a40b483b89 |
13 | 2250357cb19 |
14 | 107d8a0bc93 |
15 | 7c6c17bee3 |
hex | 46164302d9 |
301021201113 has 8 divisors (see below), whose sum is σ = 401403794976. Its totient is φ = 200659704000.
The previous prime is 301021201067. The next prime is 301021201123. The reversal of 301021201113 is 311102120103.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 301021201113 - 213 = 301021192921 is a prime.
It is a super-2 number, since 2×3010212011132 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 301021201092 and 301021201101.
It is not an unprimeable number, because it can be changed into a prime (301021201123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5240863 + ... + 5297988.
It is an arithmetic number, because the mean of its divisors is an integer number (50175474372).
Almost surely, 2301021201113 is an apocalyptic number.
It is an amenable number.
301021201113 is a deficient number, since it is larger than the sum of its proper divisors (100382593863).
301021201113 is a wasteful number, since it uses less digits than its factorization.
301021201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10548375.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 301021201113 its reverse (311102120103), we get a palindrome (612123321216).
The spelling of 301021201113 in words is "three hundred one billion, twenty-one million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •