Base | Representation |
---|---|
bin | 11101000110110111101… |
… | …11010000111001010101 |
3 | 10112121111011022110022100 |
4 | 32203123313100321111 |
5 | 112341222001010401 |
6 | 2043241014152313 |
7 | 132153635112501 |
oct | 16433367207125 |
9 | 3477434273270 |
10 | 1000121110101 |
11 | 356170325793 |
12 | 1419b6652699 |
13 | 734073c0b19 |
14 | 36598571301 |
15 | 1b0371dab86 |
hex | e8dbdd0e55 |
1000121110101 has 12 divisors (see below), whose sum is σ = 1483663148812. Its totient is φ = 648727206336.
The previous prime is 1000121110091. The next prime is 1000121110103. The reversal of 1000121110101 is 1010111210001.
It can be written as a sum of positive squares in 2 ways, for example, as 529182047601 + 470939062500 = 727449^2 + 686250^2 .
It is not a de Polignac number, because 1000121110101 - 25 = 1000121110069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000121110103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1501683016 + ... + 1501683681.
Almost surely, 21000121110101 is an apocalyptic number.
It is an amenable number.
1000121110101 is a deficient number, since it is larger than the sum of its proper divisors (483542038711).
1000121110101 is a wasteful number, since it uses less digits than its factorization.
1000121110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3003366740 (or 3003366737 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1000121110101 its reverse (1010111210001), we get a palindrome (2010232320102).
The spelling of 1000121110101 in words is "one trillion, one hundred twenty-one million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •