Base | Representation |
---|---|
bin | 11101001010100011101… |
… | …00001000110110011001 |
3 | 10112210121001221120221100 |
4 | 32211101310020312121 |
5 | 112404300100032301 |
6 | 2044205224502013 |
7 | 132253654322304 |
oct | 16452164106631 |
9 | 3483531846840 |
10 | 1002100002201 |
11 | 356a96365701 |
12 | 14226931a909 |
13 | 736613876ac |
14 | 367052d3b3b |
15 | 1b100cce286 |
hex | e951d08d99 |
1002100002201 has 24 divisors (see below), whose sum is σ = 1613287933920. Its totient is φ = 595675541376.
The previous prime is 1002100002193. The next prime is 1002100002203. The reversal of 1002100002201 is 1022000012001.
It is not a de Polignac number, because 1002100002201 - 23 = 1002100002193 is a prime.
It is a super-2 number, since 2×10021000022012 (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 not an unprimeable number, because it can be changed into a prime (1002100002203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 172356915 + ... + 172362728.
It is an arithmetic number, because the mean of its divisors is an integer number (67220330580).
Almost surely, 21002100002201 is an apocalyptic number.
It is an amenable number.
1002100002201 is a deficient number, since it is larger than the sum of its proper divisors (611187931719).
1002100002201 is a wasteful number, since it uses less digits than its factorization.
1002100002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344719685 (or 344719682 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1002100002201 its reverse (1022000012001), we get a palindrome (2024100014202).
The spelling of 1002100002201 in words is "one trillion, two billion, one hundred million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •