Base | Representation |
---|---|
bin | 11101001000101101000… |
… | …00111011011111100100 |
3 | 10112201000201212212210112 |
4 | 32210112200323133210 |
5 | 112400230402023022 |
6 | 2043522404512152 |
7 | 132220214020016 |
oct | 16442640733744 |
9 | 3481021785715 |
10 | 1001105111012 |
11 | 356625811186 |
12 | 1420300ab658 |
13 | 73533218996 |
14 | 3664d1161b6 |
15 | 1b0937ab8e2 |
hex | e91683b7e4 |
1001105111012 has 12 divisors (see below), whose sum is σ = 1775933039916. Its totient is φ = 493695671040.
The previous prime is 1001105111011. The next prime is 1001105111023. The reversal of 1001105111012 is 2101115011001.
It can be written as a sum of positive squares in 2 ways, for example, as 654765798976 + 346339312036 = 809176^2 + 588506^2 .
It is a super-2 number, since 2×10011051110122 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1001105111011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1714220789 + ... + 1714221372.
It is an arithmetic number, because the mean of its divisors is an integer number (147994419993).
Almost surely, 21001105111012 is an apocalyptic number.
It is an amenable number.
1001105111012 is a deficient number, since it is larger than the sum of its proper divisors (774827928904).
1001105111012 is a wasteful number, since it uses less digits than its factorization.
1001105111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3428442238 (or 3428442236 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 14.
The spelling of 1001105111012 in words is "one trillion, one billion, one hundred five million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •