Base | Representation |
---|---|
bin | 11101000110101010101… |
… | …11000101011001110001 |
3 | 10112121012120000122122101 |
4 | 32203111113011121301 |
5 | 112341011033323441 |
6 | 2043222115540401 |
7 | 132151141562614 |
oct | 16432527053161 |
9 | 3477176018571 |
10 | 1000012011121 |
11 | 35611478a042 |
12 | 141985bba701 |
13 | 733ba912906 |
14 | 36587c9217b |
15 | 1b02c83a231 |
hex | e8d55c5671 |
1000012011121 has 8 divisors (see below), whose sum is σ = 1010721825000. Its totient is φ = 989318054400.
The previous prime is 1000012011091. The next prime is 1000012011127. The reversal of 1000012011121 is 1211102100001.
It can be written as a sum of positive squares in 4 ways, for example, as 457489904400 + 542522106721 = 676380^2 + 736561^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 1000012011121 - 213 = 1000012002929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000012011098 and 1000012011107.
It is not an unprimeable number, because it can be changed into a prime (1000012011127) 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, 3837466 + ... + 4089763.
It is an arithmetic number, because the mean of its divisors is an integer number (126340228125).
Almost surely, 21000012011121 is an apocalyptic number.
It is an amenable number.
1000012011121 is a deficient number, since it is larger than the sum of its proper divisors (10709813879).
1000012011121 is a wasteful number, since it uses less digits than its factorization.
1000012011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7928579.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1000012011121 its reverse (1211102100001), we get a palindrome (2211114111122).
The spelling of 1000012011121 in words is "one trillion, twelve million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •