Base | Representation |
---|---|
bin | 11101001010011000111… |
… | …01100111011100001111 |
3 | 10112210100210222210002110 |
4 | 32211030131213130033 |
5 | 112404104103241421 |
6 | 2044152300155103 |
7 | 132251514162516 |
oct | 16451435473417 |
9 | 3483323883073 |
10 | 1002010212111 |
11 | 356a4a708017 |
12 | 142243238a93 |
13 | 736488aa16c |
14 | 366d73dd67d |
15 | 1b0e7e94a76 |
hex | e94c76770f |
1002010212111 has 16 divisors (see below), whose sum is σ = 1415453405184. Its totient is φ = 628334177664.
The previous prime is 1002010212061. The next prime is 1002010212251. The reversal of 1002010212111 is 1112120102001.
It is not a de Polignac number, because 1002010212111 - 213 = 1002010203919 is a prime.
It is a super-2 number, since 2×10020102121112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002010212611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5822361 + ... + 5991986.
It is an arithmetic number, because the mean of its divisors is an integer number (88465837824).
Almost surely, 21002010212111 is an apocalyptic number.
1002010212111 is a deficient number, since it is larger than the sum of its proper divisors (413443193073).
1002010212111 is a wasteful number, since it uses less digits than its factorization.
1002010212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11816030.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1002010212111 its reverse (1112120102001), we get a palindrome (2114130314112).
It can be divided in two parts, 1002010 and 212111, that added together give a palindrome (1214121).
The spelling of 1002010212111 in words is "one trillion, two billion, ten million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •