Base | Representation |
---|---|
bin | 11101000110110101010… |
… | …10100101101001010010 |
3 | 10112121102202111021011020 |
4 | 32203122222211221102 |
5 | 112341201324310002 |
6 | 2043235015300310 |
7 | 132153302215563 |
oct | 16433252455122 |
9 | 3477382437136 |
10 | 1000101010002 |
11 | 35615aa47236 |
12 | 1419ab97a696 |
13 | 734031a3c83 |
14 | 36595a1c16a |
15 | 1b03556a2bc |
hex | e8daaa5a52 |
1000101010002 has 16 divisors (see below), whose sum is σ = 2008501616352. Its totient is φ = 331983737280.
The previous prime is 1000101009983. The next prime is 1000101010021. The reversal of 1000101010002 is 2000101010001.
1000101010002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1000101009983) and next prime (1000101010021).
It is a Harshad number since it is a multiple of its sum of digits (6).
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, 345814948 + ... + 345817839.
It is an arithmetic number, because the mean of its divisors is an integer number (125531351022).
Almost surely, 21000101010002 is an apocalyptic number.
1000101010002 is an abundant number, since it is smaller than the sum of its proper divisors (1008400606350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000101010002 is a wasteful number, since it uses less digits than its factorization.
1000101010002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 691633033.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 1000101010002 its reverse (2000101010001), we get a palindrome (3000202020003).
Subtracting 1000101010002 from its reverse (2000101010001), we obtain a palindrome (999999999999).
The spelling of 1000101010002 in words is "one trillion, one hundred one million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •