Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …011101111110110011001 |
3 | 10222011112212210021012112 |
4 | 100110002003233312121 |
5 | 121331322334013423 |
6 | 2214553454322105 |
7 | 143663642201036 |
oct | 20240203576631 |
9 | 3864485707175 |
10 | 1121021001113 |
11 | 3a2471148292 |
12 | 1613177b9335 |
13 | 81933b64080 |
14 | 3c38720638d |
15 | 1e26119aa78 |
hex | 105020efd99 |
1121021001113 has 16 divisors (see below), whose sum is σ = 1208683796880. Its totient is φ = 1033563193344.
The previous prime is 1121021001073. The next prime is 1121021001151. The reversal of 1121021001113 is 3111001201211.
It can be written as a sum of positive squares in 8 ways, for example, as 5468898304 + 1115552102809 = 73952^2 + 1056197^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121021001113 - 26 = 1121021001049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121021001013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49960745 + ... + 49983177.
It is an arithmetic number, because the mean of its divisors is an integer number (75542737305).
Almost surely, 21121021001113 is an apocalyptic number.
1121021001113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1121021001113 is a deficient number, since it is larger than the sum of its proper divisors (87662795767).
1121021001113 is a wasteful number, since it uses less digits than its factorization.
1121021001113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26828.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1121021001113 its reverse (3111001201211), we get a palindrome (4232022202324).
The spelling of 1121021001113 in words is "one trillion, one hundred twenty-one billion, twenty-one million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •