Base | Representation |
---|---|
bin | 100011101000000001… |
… | …1011011000000010000 |
3 | 21022110202122210001121 |
4 | 1013100003123000100 |
5 | 2223140240031000 |
6 | 55051303412024 |
7 | 5345602534030 |
oct | 1072003330020 |
9 | 238422583047 |
10 | 76505002000 |
11 | 2a49a096389 |
12 | 129b1454014 |
13 | 72a302a16b |
14 | 39ba91d8c0 |
15 | 1ecb74db1a |
hex | 11d00db010 |
76505002000 has 160 divisors (see below), whose sum is σ = 215916180480. Its totient is φ = 25671974400.
The previous prime is 76505001983. The next prime is 76505002037. The reversal of 76505002000 is 20050567.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 599866 + ... + 716134.
It is an arithmetic number, because the mean of its divisors is an integer number (1349476128).
Almost surely, 276505002000 is an apocalyptic number.
76505002000 is a gapful number since it is divisible by the number (70) 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 76505002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107958090240).
76505002000 is an abundant number, since it is smaller than the sum of its proper divisors (139411178480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76505002000 is a wasteful number, since it uses less digits than its factorization.
76505002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116346 (or 116330 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 25.
Adding to 76505002000 its reverse (20050567), we get a palindrome (76525052567).
The spelling of 76505002000 in words is "seventy-six billion, five hundred five million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •