Base | Representation |
---|---|
bin | 11101001010010111110… |
… | …11001111011111001101 |
3 | 10112210100012000222022100 |
4 | 32211023323033133031 |
5 | 112404044301413401 |
6 | 2044151335105313 |
7 | 132251344452405 |
oct | 16451373173715 |
9 | 3483305028270 |
10 | 1002001201101 |
11 | 356a456129aa |
12 | 142240212239 |
13 | 73646a737c4 |
14 | 366d6135805 |
15 | 1b0e72b4b86 |
hex | e94becf7cd |
1002001201101 has 12 divisors (see below), whose sum is σ = 1447358095612. Its totient is φ = 667990172736.
The previous prime is 1002001201087. The next prime is 1002001201109. The reversal of 1002001201101 is 1011021002001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 668512275876 + 333488925225 = 817626^2 + 577485^2 .
It is not a de Polignac number, because 1002001201101 - 29 = 1002001200589 is a prime.
It is a super-2 number, since 2×10020012011012 (a number of 25 digits) contains 22 as substring.
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 (1002001201109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 265726 + ... + 1440351.
Almost surely, 21002001201101 is an apocalyptic number.
It is an amenable number.
1002001201101 is a deficient number, since it is larger than the sum of its proper divisors (445356894511).
1002001201101 is a wasteful number, since it uses less digits than its factorization.
1002001201101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1771340 (or 1771337 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1002001201101 its reverse (1011021002001), we get a palindrome (2013022203102).
The spelling of 1002001201101 in words is "one trillion, two billion, one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •