Base | Representation |
---|---|
bin | 1110011010011000100… |
… | …10010001110011111000 |
3 | 1202100012102020021122110 |
4 | 13031030102101303320 |
5 | 31103132440132000 |
6 | 1015254154052320 |
7 | 50530354614336 |
oct | 7151422216370 |
9 | 1670172207573 |
10 | 495201099000 |
11 | 181017124113 |
12 | 7bb81a1a0a0 |
13 | 3790ab6c79a |
14 | 19d79b4cb56 |
15 | cd346a1850 |
hex | 734c491cf8 |
495201099000 has 128 divisors (see below), whose sum is σ = 1594867322880. Its totient is φ = 127793808000.
The previous prime is 495201098999. The next prime is 495201099011. The reversal of 495201099000 is 990102594.
It is a self number, because there is not a number n which added to its sum of digits gives 495201099000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2569372 + ... + 2755371.
It is an arithmetic number, because the mean of its divisors is an integer number (12459900960).
Almost surely, 2495201099000 is an apocalyptic number.
495201099000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
495201099000 is an abundant number, since it is smaller than the sum of its proper divisors (1099666223880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495201099000 is a wasteful number, since it uses less digits than its factorization.
495201099000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5324798 (or 5324784 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 39.
The spelling of 495201099000 in words is "four hundred ninety-five billion, two hundred one million, ninety-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •