Base | Representation |
---|---|
bin | 101111100010110100… |
… | …0101000110001001110 |
3 | 100202112112012000022000 |
4 | 1133011220220301032 |
5 | 3133100100341420 |
6 | 114523141333130 |
7 | 10243063532535 |
oct | 1370550506116 |
9 | 322475160260 |
10 | 102100012110 |
11 | 3a3338822a8 |
12 | 179551071a6 |
13 | 9821902c65 |
14 | 4d27d1131c |
15 | 29c87a5690 |
hex | 17c5a28c4e |
102100012110 has 32 divisors (see below), whose sum is σ = 272266699680. Its totient is φ = 27226669824.
The previous prime is 102100012051. The next prime is 102100012111. The reversal of 102100012110 is 11210001201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 102100012092 and 102100012101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100012111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 189073827 + ... + 189074366.
It is an arithmetic number, because the mean of its divisors is an integer number (8508334365).
Almost surely, 2102100012110 is an apocalyptic number.
102100012110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102100012110 is an abundant number, since it is smaller than the sum of its proper divisors (170166687570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100012110 is a wasteful number, since it uses less digits than its factorization.
102100012110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378148209 (or 378148203 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102100012110 its reverse (11210001201), we get a palindrome (113310013311).
The spelling of 102100012110 in words is "one hundred two billion, one hundred million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •