Base | Representation |
---|---|
bin | 11101011011001000100… |
… | …10111100010111010010 |
3 | 10120122120022212102110121 |
4 | 32231210102330113102 |
5 | 113031012000031002 |
6 | 2052240314420454 |
7 | 133020344140504 |
oct | 16554422742722 |
9 | 3518508772417 |
10 | 1011000002002 |
11 | 35a843165241 |
12 | 143b31a3172a |
13 | 7444c1c4073 |
14 | 36d0b317d74 |
15 | 1b472306237 |
hex | eb644bc5d2 |
1011000002002 has 8 divisors (see below), whose sum is σ = 1516585884300. Its totient is φ = 505471373904.
The previous prime is 1011000001969. The next prime is 1011000002003. The reversal of 1011000002002 is 2002000001101.
It can be written as a sum of positive squares in 2 ways, for example, as 989072019441 + 21927982561 = 994521^2 + 148081^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (1011000002003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14269377 + ... + 14340052.
Almost surely, 21011000002002 is an apocalyptic number.
1011000002002 is a deficient number, since it is larger than the sum of its proper divisors (505585882298).
1011000002002 is a wasteful number, since it uses less digits than its factorization.
1011000002002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28627100.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 1011000002002 its reverse (2002000001101), we get a palindrome (3013000003103).
Subtracting 1011000002002 from its reverse (2002000001101), we obtain a palindrome (990999999099).
The spelling of 1011000002002 in words is "one trillion, eleven billion, two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •