Base | Representation |
---|---|
bin | 11101001101011… |
… | …00101011011100 |
3 | 122002001120210112 |
4 | 32212230223130 |
5 | 1000211304000 |
6 | 40151425152 |
7 | 6033453026 |
oct | 1646545334 |
9 | 562046715 |
10 | 245025500 |
11 | 116346315 |
12 | 6a0851b8 |
13 | 3b9c0405 |
14 | 24783016 |
15 | 167a0235 |
hex | e9acadc |
245025500 has 48 divisors (see below), whose sum is σ = 536731104. Its totient is φ = 97718400.
The previous prime is 245025493. The next prime is 245025511. The reversal of 245025500 is 5520542.
245025500 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 261032 + ... + 261968.
It is an arithmetic number, because the mean of its divisors is an integer number (11181898).
Almost surely, 2245025500 is an apocalyptic number.
245025500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 245025500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (268365552).
245025500 is an abundant number, since it is smaller than the sum of its proper divisors (291705604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
245025500 is a wasteful number, since it uses less digits than its factorization.
245025500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1479 (or 1467 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 23.
The square root of 245025500 is about 15653.2903889246. The cubic root of 245025500 is about 625.7541829003.
The spelling of 245025500 in words is "two hundred forty-five million, twenty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •