Base | Representation |
---|---|
bin | 10110111111010110001000… |
… | …001100001011101010010010 |
3 | 111021000000212102011000111100 |
4 | 112333112020030023222102 |
5 | 101223042001130310002 |
6 | 555013202052525230 |
7 | 30203651532424512 |
oct | 2677261014135222 |
9 | 437000772130440 |
10 | 101110110010002 |
11 | 2a242614190335 |
12 | b40b997320816 |
13 | 4455847648452 |
14 | 1ad7a80cb7842 |
15 | ba518cb0e11c |
hex | 5bf58830ba92 |
101110110010002 has 48 divisors (see below), whose sum is σ = 225334183726080. Its totient is φ = 32742707016096.
The previous prime is 101110110009977. The next prime is 101110110010043. The reversal of 101110110010002 is 200010011011101.
It is a Harshad number since it is a multiple of its sum of digits (9).
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 in 23 ways as a sum of consecutive naturals, for example, 114748498 + ... + 115626285.
It is an arithmetic number, because the mean of its divisors is an integer number (4694462160960).
Almost surely, 2101110110010002 is an apocalyptic number.
101110110010002 is an abundant number, since it is smaller than the sum of its proper divisors (124224073716078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110110010002 is a wasteful number, since it uses less digits than its factorization.
101110110010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230375487 (or 230375484 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101110110010002 its reverse (200010011011101), we get a palindrome (301120121021103).
The spelling of 101110110010002 in words is "one hundred one trillion, one hundred ten billion, one hundred ten million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •