Base | Representation |
---|---|
bin | 11101001111001… |
… | …01111101000101 |
3 | 122002111111121110 |
4 | 32213211331011 |
5 | 1000241310401 |
6 | 40200435233 |
7 | 6035451012 |
oct | 1647457505 |
9 | 562444543 |
10 | 245260101 |
11 | 1164965a9 |
12 | 6a178b19 |
13 | 3ba73128 |
14 | 24804709 |
15 | 167e99d6 |
hex | e9e5f45 |
245260101 has 4 divisors (see below), whose sum is σ = 327013472. Its totient is φ = 163506732.
The previous prime is 245260091. The next prime is 245260111. The reversal of 245260101 is 101062542.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (245260091) and next prime (245260111).
It is not a de Polignac number, because 245260101 - 217 = 245129029 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245260111) 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 3 ways as a sum of consecutive naturals, for example, 40876681 + ... + 40876686.
It is an arithmetic number, because the mean of its divisors is an integer number (81753368).
Almost surely, 2245260101 is an apocalyptic number.
It is an amenable number.
245260101 is a deficient number, since it is larger than the sum of its proper divisors (81753371).
245260101 is an equidigital number, since it uses as much as digits as its factorization.
245260101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81753370.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 245260101 is about 15660.7822601555. The cubic root of 245260101 is about 625.9538297802.
The spelling of 245260101 in words is "two hundred forty-five million, two hundred sixty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •