Base | Representation |
---|---|
bin | 10110111111010110000111… |
… | …100110000010010001110110 |
3 | 111021000000211201022222012200 |
4 | 112333112013212002101312 |
5 | 101223041441100310402 |
6 | 555013201054325330 |
7 | 30203651351425341 |
oct | 2677260746022166 |
9 | 437000751288180 |
10 | 101110100010102 |
11 | 2a242609580257 |
12 | b40b993ab9846 |
13 | 4455845556951 |
14 | 1ad7a7d833458 |
15 | ba518bcd621c |
hex | 5bf587982476 |
101110100010102 has 48 divisors (see below), whose sum is σ = 230611247093760. Its totient is φ = 31928222473776.
The previous prime is 101110100010089. The next prime is 101110100010103. The reversal of 101110100010102 is 201010001011101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110100010103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2604123 + ... + 14456889.
It is an arithmetic number, because the mean of its divisors is an integer number (4804400981120).
Almost surely, 2101110100010102 is an apocalyptic number.
101110100010102 is an abundant number, since it is smaller than the sum of its proper divisors (129501147083658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110100010102 is a wasteful number, since it uses less digits than its factorization.
101110100010102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11877737 (or 11877734 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101110100010102 its reverse (201010001011101), we get a palindrome (302120101021203).
The spelling of 101110100010102 in words is "one hundred one trillion, one hundred ten billion, one hundred million, ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •