Base | Representation |
---|---|
bin | 10001010110011010001011… |
… | …001101110101010100111000 |
3 | 101000011211222211200110101202 |
4 | 101112122023031311110320 |
5 | 40000202133001440211 |
6 | 430142454140033332 |
7 | 22033656525412301 |
oct | 2126321315652470 |
9 | 330154884613352 |
10 | 76306724640056 |
11 | 2234a555824439 |
12 | 8684907832848 |
13 | 3376902119951 |
14 | 14bb39d9157a8 |
15 | 8c4da66b353b |
hex | 45668b375538 |
76306724640056 has 16 divisors (see below), whose sum is σ = 143120285605440. Its totient is φ = 38141315145280.
The previous prime is 76306724640001. The next prime is 76306724640059. The reversal of 76306724640056 is 65004642760367.
It is a super-4 number, since 4×763067246400564 (a number of 57 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 76306724639983 and 76306724640010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (76306724640059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1505869925 + ... + 1505920596.
It is an arithmetic number, because the mean of its divisors is an integer number (8945017850340).
Almost surely, 276306724640056 is an apocalyptic number.
It is an amenable number.
76306724640056 is a deficient number, since it is larger than the sum of its proper divisors (66813560965384).
76306724640056 is a wasteful number, since it uses less digits than its factorization.
76306724640056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3011793694 (or 3011793690 counting only the distinct ones).
The product of its (nonzero) digits is 30481920, while the sum is 56.
The spelling of 76306724640056 in words is "seventy-six trillion, three hundred six billion, seven hundred twenty-four million, six hundred forty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •