Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1100011111101100010 |
3 | 100122221222021021001200 |
4 | 1132022021203331202 |
5 | 3124024103311320 |
6 | 114240130542030 |
7 | 10206254623155 |
oct | 1361211437542 |
9 | 318858237050 |
10 | 101102010210 |
11 | 399714a3743 |
12 | 17716a37916 |
13 | 96c2c153a6 |
14 | 4c71563c9c |
15 | 296ad6b290 |
hex | 178a263f62 |
101102010210 has 48 divisors (see below), whose sum is σ = 262889340480. Its totient is φ = 26958062880.
The previous prime is 101102010197. The next prime is 101102010257. The reversal of 101102010210 is 12010201101.
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 = 101102010192 and 101102010201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1069861 + ... + 1160519.
It is an arithmetic number, because the mean of its divisors is an integer number (5476861260).
Almost surely, 2101102010210 is an apocalyptic number.
101102010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101102010210 is an abundant number, since it is smaller than the sum of its proper divisors (161787330270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101102010210 is a wasteful number, since it uses less digits than its factorization.
101102010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103063 (or 103060 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101102010210 its reverse (12010201101), we get a palindrome (113112211311).
The spelling of 101102010210 in words is "one hundred one billion, one hundred two million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •