Base | Representation |
---|---|
bin | 11101011001011101100… |
… | …01101110000010000110 |
3 | 10120120020202022021121200 |
4 | 32230232301232002012 |
5 | 113022142114200402 |
6 | 2052011241323330 |
7 | 132656162120634 |
oct | 16545661560206 |
9 | 3516222267550 |
10 | 1010102100102 |
11 | 35a422336257 |
12 | 143921196546 |
13 | 74338183674 |
14 | 36c63d86354 |
15 | 1b41d59121c |
hex | eb2ec6e086 |
1010102100102 has 48 divisors (see below), whose sum is σ = 2277408070080. Its totient is φ = 323296361136.
The previous prime is 1010102100097. The next prime is 1010102100121. The reversal of 1010102100102 is 2010012010101.
It is a happy number.
1010102100102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11014008 + ... + 11105339.
It is an arithmetic number, because the mean of its divisors is an integer number (47446001460).
Almost surely, 21010102100102 is an apocalyptic number.
1010102100102 is an abundant number, since it is smaller than the sum of its proper divisors (1267305969978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010102100102 is a wasteful number, since it uses less digits than its factorization.
1010102100102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22119457 (or 22119454 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1010102100102 its reverse (2010012010101), we get a palindrome (3020114110203).
Subtracting 1010102100102 from its reverse (2010012010101), we obtain a palindrome (999909909999).
The spelling of 1010102100102 in words is "one trillion, ten billion, one hundred two million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •