Base | Representation |
---|---|
bin | 1111100110110… |
… | …0001111001010 |
3 | 11120011110110010 |
4 | 3321230033022 |
5 | 113224030200 |
6 | 10254532350 |
7 | 1423234023 |
oct | 371541712 |
9 | 146143403 |
10 | 65455050 |
11 | 33a47391 |
12 | 19b070b6 |
13 | 10739bcb |
14 | 899bc4a |
15 | 5b2e150 |
hex | 3e6c3ca |
65455050 has 48 divisors (see below), whose sum is σ = 164185920. Its totient is φ = 17255040.
The previous prime is 65455037. The next prime is 65455051. The reversal of 65455050 is 5055456.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 65454999 and 65455017.
It is not an unprimeable number, because it can be changed into a prime (65455051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10899 + ... + 15801.
It is an arithmetic number, because the mean of its divisors is an integer number (3420540).
Almost surely, 265455050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65455050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82092960).
65455050 is an abundant number, since it is smaller than the sum of its proper divisors (98730870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65455050 is a wasteful number, since it uses less digits than its factorization.
65455050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5007 (or 5002 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 30.
The square root of 65455050 is about 8090.4295312425. The cubic root of 65455050 is about 403.0086672315.
The spelling of 65455050 in words is "sixty-five million, four hundred fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •