Base | Representation |
---|---|
bin | 101111100110000110… |
… | …0010010011101100011 |
3 | 100202211012012001102110 |
4 | 1133030030102131203 |
5 | 3133311231134334 |
6 | 114542111250403 |
7 | 10245600563025 |
oct | 1371414223543 |
9 | 322735161373 |
10 | 102210021219 |
11 | 3a38a98a819 |
12 | 17985b19a03 |
13 | 983b63c4c7 |
14 | 4d3878a015 |
15 | 29d3285ae9 |
hex | 17cc312763 |
102210021219 has 16 divisors (see below), whose sum is σ = 145884067200. Its totient is φ = 63459565056.
The previous prime is 102210021217. The next prime is 102210021233. The reversal of 102210021219 is 912120012201.
It is not a de Polignac number, because 102210021219 - 21 = 102210021217 is a prime.
It is a super-3 number, since 3×1022100212193 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 102210021195 and 102210021204.
It is not an unprimeable number, because it can be changed into a prime (102210021217) 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 15 ways as a sum of consecutive naturals, for example, 15192894 + ... + 15199619.
It is an arithmetic number, because the mean of its divisors is an integer number (9117754200).
Almost surely, 2102210021219 is an apocalyptic number.
102210021219 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
102210021219 is a deficient number, since it is larger than the sum of its proper divisors (43674045981).
102210021219 is a wasteful number, since it uses less digits than its factorization.
102210021219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30392594.
The product of its (nonzero) digits is 144, while the sum is 21.
The spelling of 102210021219 in words is "one hundred two billion, two hundred ten million, twenty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •