Base | Representation |
---|---|
bin | 101111100000011100… |
… | …0001011011010101110 |
3 | 100202022222000010211000 |
4 | 1133000320023122232 |
5 | 3132414132400420 |
6 | 114511210541130 |
7 | 10241104251513 |
oct | 1370070133256 |
9 | 322288003730 |
10 | 102020200110 |
11 | 3a2a281a374 |
12 | 179324377a6 |
13 | 980b20a31a |
14 | 4d1b49730a |
15 | 29c178c690 |
hex | 17c0e0b6ae |
102020200110 has 32 divisors (see below), whose sum is σ = 272053867680. Its totient is φ = 27205386624.
The previous prime is 102020200109. The next prime is 102020200129. The reversal of 102020200110 is 11002020201.
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 = 102020200092 and 102020200101.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 188926027 + ... + 188926566.
It is an arithmetic number, because the mean of its divisors is an integer number (8501683365).
Almost surely, 2102020200110 is an apocalyptic number.
102020200110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102020200110 is an abundant number, since it is smaller than the sum of its proper divisors (170033667570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020200110 is a wasteful number, since it uses less digits than its factorization.
102020200110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377852609 (or 377852603 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102020200110 its reverse (11002020201), we get a palindrome (113022220311).
The spelling of 102020200110 in words is "one hundred two billion, twenty million, two hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •