Base | Representation |
---|---|
bin | 101111100011110001… |
… | …1100000000100110111 |
3 | 100202121202210100111210 |
4 | 1133013203200010313 |
5 | 3133131322021330 |
6 | 114530251532503 |
7 | 10243634355654 |
oct | 1370743400467 |
9 | 322552710453 |
10 | 102132220215 |
11 | 3a34aa80773 |
12 | 17963a5a133 |
13 | 982849bccc |
14 | 4d2c2d6c2b |
15 | 29cb5188b0 |
hex | 17c78e0137 |
102132220215 has 8 divisors (see below), whose sum is σ = 163411552368. Its totient is φ = 54470517440.
The previous prime is 102132220181. The next prime is 102132220231. The reversal of 102132220215 is 512022231201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102132220215 - 29 = 102132219703 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102132220191 and 102132220200.
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 7 ways as a sum of consecutive naturals, for example, 3404407326 + ... + 3404407355.
It is an arithmetic number, because the mean of its divisors is an integer number (20426444046).
Almost surely, 2102132220215 is an apocalyptic number.
102132220215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
102132220215 is a deficient number, since it is larger than the sum of its proper divisors (61279332153).
102132220215 is an equidigital number, since it uses as much as digits as its factorization.
102132220215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6808814689.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 102132220215 its reverse (512022231201), we get a palindrome (614154451416).
The spelling of 102132220215 in words is "one hundred two billion, one hundred thirty-two million, two hundred twenty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •