Base | Representation |
---|---|
bin | 100011100100111001… |
… | …1000001100001000000 |
3 | 21022012110011011021010 |
4 | 1013021303001201000 |
5 | 2222431402240000 |
6 | 55033034000520 |
7 | 5343156424254 |
oct | 1071163014100 |
9 | 238173134233 |
10 | 76400040000 |
11 | 2a445915929 |
12 | 12982276140 |
13 | 7287369c7b |
14 | 39aa9da264 |
15 | 1ec2418d50 |
hex | 11c9cc1840 |
76400040000 has 420 divisors, whose sum is σ = 268450805744. Its totient is φ = 19166208000.
The previous prime is 76400039999. The next prime is 76400040007. The reversal of 76400040000 is 4000467.
It is a super-3 number, since 3×764000400003 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (76400040007) by changing a digit.
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 59 ways as a sum of consecutive naturals, for example, 34678899 + ... + 34681101.
Almost surely, 276400040000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 76400040000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134225402872).
76400040000 is an abundant number, since it is smaller than the sum of its proper divisors (192050765744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76400040000 is a wasteful number, since it uses less digits than its factorization.
76400040000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2272 (or 2230 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 21.
Adding to 76400040000 its reverse (4000467), we get a palindrome (76404040467).
The spelling of 76400040000 in words is "seventy-six billion, four hundred million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •