Base | Representation |
---|---|
bin | 11101100000110… |
… | …101000010010110 |
3 | 1021111200222101210 |
4 | 131200311002112 |
5 | 2003224120420 |
6 | 121044402250 |
7 | 15161443515 |
oct | 3540650226 |
9 | 1244628353 |
10 | 495145110 |
11 | 234550939 |
12 | 1199a6386 |
13 | 7b775395 |
14 | 49a9067c |
15 | 2d7099e0 |
hex | 1d835096 |
495145110 has 64 divisors (see below), whose sum is σ = 1238146560. Its totient is φ = 126616320.
The previous prime is 495145109. The next prime is 495145163. The reversal of 495145110 is 11541594.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69159 + ... + 75981.
It is an arithmetic number, because the mean of its divisors is an integer number (19346040).
Almost surely, 2495145110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 495145110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (619073280).
495145110 is an abundant number, since it is smaller than the sum of its proper divisors (743001450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495145110 is a wasteful number, since it uses less digits than its factorization.
495145110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6933.
The product of its (nonzero) digits is 3600, while the sum is 30.
The square root of 495145110 is about 22251.8563270573. The cubic root of 495145110 is about 791.1232805711.
The spelling of 495145110 in words is "four hundred ninety-five million, one hundred forty-five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •