Base | Representation |
---|---|
bin | 1000101110110011111… |
… | …11101101010110011001 |
3 | 1001200101012221011111200 |
4 | 10113121333231112121 |
5 | 14403410041200441 |
6 | 345453413344413 |
7 | 30450346526634 |
oct | 4273177552631 |
9 | 1050335834450 |
10 | 300010100121 |
11 | 106262975706 |
12 | 4a188938109 |
13 | 223a1c56c04 |
14 | 10740610c1b |
15 | 7c0d5067b6 |
hex | 45d9fed599 |
300010100121 has 12 divisors (see below), whose sum is σ = 433482169380. Its totient is φ = 199944773280.
The previous prime is 300010100101. The next prime is 300010100179. The reversal of 300010100121 is 121001010003.
It can be written as a sum of positive squares in 2 ways, for example, as 186987056400 + 113023043721 = 432420^2 + 336189^2 .
It is not a de Polignac number, because 300010100121 - 231 = 297862616473 is a prime.
It is a super-2 number, since 2×3000101001212 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (300010100101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5132670 + ... + 5190791.
It is an arithmetic number, because the mean of its divisors is an integer number (36123514115).
Almost surely, 2300010100121 is an apocalyptic number.
It is an amenable number.
300010100121 is a deficient number, since it is larger than the sum of its proper divisors (133472069259).
300010100121 is a wasteful number, since it uses less digits than its factorization.
300010100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10326696 (or 10326693 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 300010100121 its reverse (121001010003), we get a palindrome (421011110124).
The spelling of 300010100121 in words is "three hundred billion, ten million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •