Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …010000011101001010110010 |
3 | 111020222011100121010112210101 |
4 | 112333031221100131022302 |
5 | 101222414322240231002 |
6 | 555005054141223014 |
7 | 30203210025120436 |
oct | 2677155120351262 |
9 | 436864317115711 |
10 | 101101001102002 |
11 | 2a23976a4739a0 |
12 | b40a074861a6a |
13 | 4454a25455b65 |
14 | 1ad74592329c6 |
15 | ba4d080bd587 |
hex | 5bf36941d2b2 |
101101001102002 has 16 divisors (see below), whose sum is σ = 174145265056800. Its totient is φ = 43536316263840.
The previous prime is 101101001101913. The next prime is 101101001102027. The reversal of 101101001102002 is 200201100101101.
It is a super-3 number, since 3×1011010011020023 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101101001102002.
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, 120934211427 + ... + 120934212262.
It is an arithmetic number, because the mean of its divisors is an integer number (10884079066050).
Almost surely, 2101101001102002 is an apocalyptic number.
101101001102002 is a deficient number, since it is larger than the sum of its proper divisors (73044263954798).
101101001102002 is a wasteful number, since it uses less digits than its factorization.
101101001102002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241868423721.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101101001102002 its reverse (200201100101101), we get a palindrome (301302101203103).
The spelling of 101101001102002 in words is "one hundred one trillion, one hundred one billion, one million, one hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •