Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …110101011000000001101010 |
3 | 111021000010012010122022001100 |
4 | 112333112331311120001222 |
5 | 101223100322030013002 |
6 | 555013431242502230 |
7 | 30204013041265131 |
oct | 2677267565300152 |
9 | 437003163568040 |
10 | 101111010001002 |
11 | 2a242a36206951 |
12 | b40bba8804976 |
13 | 445595bc3a9c1 |
14 | 1ad7b28630918 |
15 | ba51e1b3811c |
hex | 5bf5bdd5806a |
101111010001002 has 12 divisors (see below), whose sum is σ = 219073855002210. Its totient is φ = 33703670000328.
The previous prime is 101111010000991. The next prime is 101111010001081. The reversal of 101111010001002 is 200100010111101.
It can be written as a sum of positive squares in only one way, i.e., 100917314069121 + 193695931881 = 10045761^2 + 440109^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2808639166677 + ... + 2808639166712.
Almost surely, 2101111010001002 is an apocalyptic number.
101111010001002 is an abundant number, since it is smaller than the sum of its proper divisors (117962845001208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111010001002 is a wasteful number, since it uses less digits than its factorization.
101111010001002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5617278333397 (or 5617278333394 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101111010001002 its reverse (200100010111101), we get a palindrome (301211020112103).
The spelling of 101111010001002 in words is "one hundred one trillion, one hundred eleven billion, ten million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •