Base | Representation |
---|---|
bin | 11101001010101111101… |
… | …01111000000011110100 |
3 | 10112210212010012221212111 |
4 | 32211113311320003310 |
5 | 112410001441333022 |
6 | 2044223240100404 |
7 | 132256322654320 |
oct | 16452765700364 |
9 | 3483763187774 |
10 | 1002201121012 |
11 | 357038450773 |
12 | 142297164704 |
13 | 73679300500 |
14 | 367148d6980 |
15 | 1b109b05477 |
hex | e957d780f4 |
1002201121012 has 72 divisors (see below), whose sum is σ = 2170768088832. Its totient is φ = 396416592000.
The previous prime is 1002201121007. The next prime is 1002201121039. The reversal of 1002201121012 is 2101211022001.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 1002201120983 and 1002201121001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 46840837 + ... + 46862227.
Almost surely, 21002201121012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1002201121012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1085384044416).
1002201121012 is an abundant number, since it is smaller than the sum of its proper divisors (1168566967820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002201121012 is a wasteful number, since it uses less digits than its factorization.
1002201121012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31329 (or 31314 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1002201121012 its reverse (2101211022001), we get a palindrome (3103412143013).
The spelling of 1002201121012 in words is "one trillion, two billion, two hundred one million, one hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •