Base | Representation |
---|---|
bin | 1100111001100… |
… | …00100111110001 |
3 | 21112121020220022 |
4 | 12130300213301 |
5 | 210144434411 |
6 | 14423053225 |
7 | 2452464062 |
oct | 634604761 |
9 | 245536808 |
10 | 108202481 |
11 | 56094142 |
12 | 302a1215 |
13 | 1955614a |
14 | 10528569 |
15 | 9774edb |
hex | 67309f1 |
108202481 has 2 divisors, whose sum is σ = 108202482. Its totient is φ = 108202480.
The previous prime is 108202477. The next prime is 108202483. The reversal of 108202481 is 184202801.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87590881 + 20611600 = 9359^2 + 4540^2 .
It is an emirp because it is prime and its reverse (184202801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 108202481 - 22 = 108202477 is a prime.
It is a super-2 number, since 2×1082024812 = 23415553789110722, which contains 22 as substring.
Together with 108202483, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 108202481.
It is not a weakly prime, because it can be changed into another prime (108202483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54101240 + 54101241.
It is an arithmetic number, because the mean of its divisors is an integer number (54101241).
Almost surely, 2108202481 is an apocalyptic number.
It is an amenable number.
108202481 is a deficient number, since it is larger than the sum of its proper divisors (1).
108202481 is an equidigital number, since it uses as much as digits as its factorization.
108202481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1024, while the sum is 26.
The square root of 108202481 is about 10402.0421552693. The cubic root of 108202481 is about 476.5177395660.
The spelling of 108202481 in words is "one hundred eight million, two hundred two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •