Base | Representation |
---|---|
bin | 1011100011101011… |
… | …1010100110000101 |
3 | 22000012210220012101 |
4 | 2320322322212011 |
5 | 22323211431401 |
6 | 1231504152101 |
7 | 136611256600 |
oct | 27072724605 |
9 | 8005726171 |
10 | 3102452101 |
11 | 1352287201 |
12 | 727008631 |
13 | 3a59a6198 |
14 | 216075337 |
15 | 132580101 |
hex | b8eba985 |
3102452101 has 6 divisors (see below), whose sum is σ = 3608974950. Its totient is φ = 2659244616.
The previous prime is 3102452099. The next prime is 3102452123. The reversal of 3102452101 is 1012542013.
It can be written as a sum of positive squares in only one way, i.e., 2042949601 + 1059502500 = 45199^2 + 32550^2 .
It is not a de Polignac number, because 3102452101 - 21 = 3102452099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3102452201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 31657626 + ... + 31657723.
It is an arithmetic number, because the mean of its divisors is an integer number (601495825).
Almost surely, 23102452101 is an apocalyptic number.
It is an amenable number.
3102452101 is a deficient number, since it is larger than the sum of its proper divisors (506522849).
3102452101 is an equidigital number, since it uses as much as digits as its factorization.
3102452101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63315363 (or 63315356 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 3102452101 is about 55699.6597924978. The cubic root of 3102452101 is about 1458.4840869577.
Adding to 3102452101 its reverse (1012542013), we get a palindrome (4114994114).
The spelling of 3102452101 in words is "three billion, one hundred two million, four hundred fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •