Base | Representation |
---|---|
bin | 101111100011000111… |
… | …1100000000110011011 |
3 | 100202120020100121202101 |
4 | 1133012033200012123 |
5 | 3133110202401334 |
6 | 114524143544231 |
7 | 10243246244506 |
oct | 1370617400633 |
9 | 322506317671 |
10 | 102110200219 |
11 | 3a339600825 |
12 | 179585bb077 |
13 | 9823a5c321 |
14 | 4d2940413d |
15 | 29c9619214 |
hex | 17c63e019b |
102110200219 has 4 divisors (see below), whose sum is σ = 102117334720. Its totient is φ = 102103065720.
The previous prime is 102110200211. The next prime is 102110200243. The reversal of 102110200219 is 912002011201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102110200219 - 23 = 102110200211 is a prime.
It is a super-2 number, since 2×1021102002192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102110200196 and 102110200205.
It is not an unprimeable number, because it can be changed into a prime (102110200211) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 3545739 + ... + 3574420.
It is an arithmetic number, because the mean of its divisors is an integer number (25529333680).
Almost surely, 2102110200219 is an apocalyptic number.
102110200219 is a deficient number, since it is larger than the sum of its proper divisors (7134501).
102110200219 is an equidigital number, since it uses as much as digits as its factorization.
102110200219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7134500.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 102110200219 in words is "one hundred two billion, one hundred ten million, two hundred thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •