Base | Representation |
---|---|
bin | 10010110101010111… |
… | …00011001000011001 |
3 | 222002200012021012002 |
4 | 21122223203020121 |
5 | 131201443100441 |
6 | 4351200130345 |
7 | 505365430046 |
oct | 113253431031 |
9 | 28080167162 |
10 | 10111300121 |
11 | 431962448a |
12 | 1b623069b5 |
13 | c51a89530 |
14 | 6bcc561cd |
15 | 3e2a45b9b |
hex | 25aae3219 |
10111300121 has 8 divisors (see below), whose sum is σ = 10936646280. Its totient is φ = 9292747392.
The previous prime is 10111300099. The next prime is 10111300123. The reversal of 10111300121 is 12100311101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 4898460121 + 5212840000 = 69989^2 + 72200^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10111300121 - 218 = 10111037977 is a prime.
It is a super-2 number, since 2×101113001212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111300123) 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, 1695260 + ... + 1701213.
It is an arithmetic number, because the mean of its divisors is an integer number (1367080785).
Almost surely, 210111300121 is an apocalyptic number.
It is an amenable number.
10111300121 is a deficient number, since it is larger than the sum of its proper divisors (825346159).
10111300121 is a wasteful number, since it uses less digits than its factorization.
10111300121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3396715.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 10111300121 its reverse (12100311101), we get a palindrome (22211611222).
The spelling of 10111300121 in words is "ten billion, one hundred eleven million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •