Base | Representation |
---|---|
bin | 1011101001101001011… |
… | …0001011010101100000 |
3 | 201010122100120221102001 |
4 | 2322122112023111200 |
5 | 11234410422003410 |
6 | 231541252333344 |
7 | 20314046634544 |
oct | 2723226132540 |
9 | 633570527361 |
10 | 200158000480 |
11 | 77982a78309 |
12 | 32960614254 |
13 | 15b4ac8c799 |
14 | 998b08da24 |
15 | 531728433a |
hex | 2e9a58b560 |
200158000480 has 96 divisors (see below), whose sum is σ = 496191225600. Its totient is φ = 76154107392.
The previous prime is 200158000463. The next prime is 200158000499. The reversal of 200158000480 is 84000851002.
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, 506791 + ... + 810649.
It is an arithmetic number, because the mean of its divisors is an integer number (5168658600).
Almost surely, 2200158000480 is an apocalyptic number.
200158000480 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 200158000480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (248095612800).
200158000480 is an abundant number, since it is smaller than the sum of its proper divisors (296033225120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200158000480 is a wasteful number, since it uses less digits than its factorization.
200158000480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304076 (or 304068 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 28.
Adding to 200158000480 its reverse (84000851002), we get a palindrome (284158851482).
The spelling of 200158000480 in words is "two hundred billion, one hundred fifty-eight million, four hundred eighty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •