Base | Representation |
---|---|
bin | 101111100110010100… |
… | …0011101000110111101 |
3 | 100202211201002011212200 |
4 | 1133030220131012331 |
5 | 3133320123423421 |
6 | 114542533422113 |
7 | 10246020414465 |
oct | 1371450350675 |
9 | 322751064780 |
10 | 102217404861 |
11 | 3a394073200 |
12 | 1798849a939 |
13 | 9840026220 |
14 | 4d3974cba5 |
15 | 29d3c43726 |
hex | 17cca1d1bd |
102217404861 has 72 divisors (see below), whose sum is σ = 175890962520. Its totient is φ = 56819093760.
The previous prime is 102217404841. The next prime is 102217404953. The reversal of 102217404861 is 168404712201.
It is a happy number.
102217404861 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 174 + 0 + 486 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 6708592836 + 95508812025 = 81906^2 + 309045^2 .
It is not a de Polignac number, because 102217404861 - 25 = 102217404829 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102217404841) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2199655 + ... + 2245643.
It is an arithmetic number, because the mean of its divisors is an integer number (2442930035).
Almost surely, 2102217404861 is an apocalyptic number.
102217404861 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102217404861 is a deficient number, since it is larger than the sum of its proper divisors (73673557659).
102217404861 is a wasteful number, since it uses less digits than its factorization.
102217404861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46187 (or 46173 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 36.
The spelling of 102217404861 in words is "one hundred two billion, two hundred seventeen million, four hundred four thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.235 sec. • engine limits •