Base | Representation |
---|---|
bin | 10110111111010110001000… |
… | …010100001010011001110010 |
3 | 111021000000212120002022011211 |
4 | 112333112020110022121302 |
5 | 101223042002144231002 |
6 | 555013202205430334 |
7 | 30203651556256603 |
oct | 2677261024123162 |
9 | 437000776068154 |
10 | 101110112102002 |
11 | 2a24261538a063 |
12 | b40b997b6b3aa |
13 | 4455847bcb713 |
14 | 1ad7a8129ddaa |
15 | ba518cdc3dd7 |
hex | 5bf58850a672 |
101110112102002 has 4 divisors (see below), whose sum is σ = 151665168153006. Its totient is φ = 50555056051000.
The previous prime is 101110112101997. The next prime is 101110112102033. The reversal of 101110112102002 is 200201211011101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 100646461417441 + 463650684561 = 10032271^2 + 680919^2 .
It is a super-2 number, since 2×1011101121020022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25277528025499 + ... + 25277528025502.
Almost surely, 2101110112102002 is an apocalyptic number.
101110112102002 is a deficient number, since it is larger than the sum of its proper divisors (50555056051004).
101110112102002 is an equidigital number, since it uses as much as digits as its factorization.
101110112102002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50555056051003.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101110112102002 its reverse (200201211011101), we get a palindrome (301311323113103).
The spelling of 101110112102002 in words is "one hundred one trillion, one hundred ten billion, one hundred twelve million, one hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •