Base | Representation |
---|---|
bin | 11101001010100011111… |
… | …00100110110010111100 |
3 | 10112210121020010100221120 |
4 | 32211101330212302330 |
5 | 112404301132101022 |
6 | 2044205344230540 |
7 | 132254012226123 |
oct | 16452174466274 |
9 | 3483536110846 |
10 | 1002102222012 |
11 | 356a97641461 |
12 | 14226a00b450 |
13 | 73661983ba8 |
14 | 36705710aba |
15 | 1b1010bbd5c |
hex | e951f26cbc |
1002102222012 has 24 divisors (see below), whose sum is σ = 2338562620800. Its totient is φ = 333987773616.
The previous prime is 1002102221977. The next prime is 1002102222049. The reversal of 1002102222012 is 2102222012001.
It is a super-2 number, since 2×10021022220122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1002102221982 and 1002102222000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5697312 + ... + 5870567.
It is an arithmetic number, because the mean of its divisors is an integer number (97440109200).
Almost surely, 21002102222012 is an apocalyptic number.
1002102222012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1002102222012 is an abundant number, since it is smaller than the sum of its proper divisors (1336460398788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002102222012 is a wasteful number, since it uses less digits than its factorization.
1002102222012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11575105 (or 11575103 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1002102222012 its reverse (2102222012001), we get a palindrome (3104324234013).
The spelling of 1002102222012 in words is "one trillion, two billion, one hundred two million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •