Base | Representation |
---|---|
bin | 1001000110101010100111… |
… | …0001000001101001101010 |
3 | 1022102221212121120011212101 |
4 | 2101222221301001221222 |
5 | 2303001212213013002 |
6 | 33142330410404014 |
7 | 2052131104053304 |
oct | 221525161015152 |
9 | 38387777504771 |
10 | 10010122001002 |
11 | 320a2a59a7202 |
12 | 115804173060a |
13 | 577c481c0626 |
14 | 2686c756c974 |
15 | 1255bd89e587 |
hex | 91aa9c41a6a |
10010122001002 has 48 divisors (see below), whose sum is σ = 15398281899000. Its totient is φ = 4880355667200.
The previous prime is 10010122000981. The next prime is 10010122001003. The reversal of 10010122001002 is 20010022101001.
It can be written as a sum of positive squares in 12 ways, for example, as 816982784641 + 9193139216361 = 903871^2 + 3032019^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 10010122001002.
It is not an unprimeable number, because it can be changed into a prime (10010122001003) 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, 2795340852 + ... + 2795344432.
Almost surely, 210010122001002 is an apocalyptic number.
10010122001002 is a deficient number, since it is larger than the sum of its proper divisors (5388159897998).
10010122001002 is a wasteful number, since it uses less digits than its factorization.
10010122001002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6619 (or 6566 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10010122001002 its reverse (20010022101001), we get a palindrome (30020144102003).
Subtracting 10010122001002 from its reverse (20010022101001), we obtain a palindrome (9999900099999).
The spelling of 10010122001002 in words is "ten trillion, ten billion, one hundred twenty-two million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •