Base | Representation |
---|---|
bin | 11101010000011… |
… | …10001101101101 |
3 | 122002210212211000 |
4 | 32220032031231 |
5 | 1000312100010 |
6 | 40204150513 |
7 | 6040035540 |
oct | 1650161555 |
9 | 562725730 |
10 | 245425005 |
11 | 116599491 |
12 | 6a238439 |
13 | 3bb001c7 |
14 | 24848857 |
15 | 1682d7c0 |
hex | ea0e36d |
245425005 has 64 divisors (see below), whose sum is σ = 528007680. Its totient is φ = 105587712.
The previous prime is 245424997. The next prime is 245425009. The reversal of 245425005 is 500524542.
It is not a de Polignac number, because 245425005 - 23 = 245424997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 245425005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245425009) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8427 + ... + 23703.
It is an arithmetic number, because the mean of its divisors is an integer number (8250120).
Almost surely, 2245425005 is an apocalyptic number.
It is an amenable number.
245425005 is an abundant number, since it is smaller than the sum of its proper divisors (282582675).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
245425005 is a wasteful number, since it uses less digits than its factorization.
245425005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15315 (or 15309 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 27.
The square root of 245425005 is about 15666.0462465805. The cubic root of 245425005 is about 626.0940879037.
Adding to 245425005 its reverse (500524542), we get a palindrome (745949547).
The spelling of 245425005 in words is "two hundred forty-five million, four hundred twenty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •