Base | Representation |
---|---|
bin | 100011011101011010… |
… | …0000110011101011001 |
3 | 21021112221010221102120 |
4 | 1012322310012131121 |
5 | 2221423024223103 |
6 | 54552054051453 |
7 | 5334014652132 |
oct | 1067264063531 |
9 | 237487127376 |
10 | 76148664153 |
11 | 2a326a324a1 |
12 | 12912049b89 |
13 | 7247265273 |
14 | 3985482c89 |
15 | 1eaa312253 |
hex | 11bad06759 |
76148664153 has 8 divisors (see below), whose sum is σ = 101536921728. Its totient is φ = 50763091344.
The previous prime is 76148664143. The next prime is 76148664169. The reversal of 76148664153 is 35146684167.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 76148664153 - 29 = 76148663641 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 76148664096 and 76148664105.
It is not an unprimeable number, because it can be changed into a prime (76148664143) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 604050 + ... + 719147.
It is an arithmetic number, because the mean of its divisors is an integer number (12692115216).
Almost surely, 276148664153 is an apocalyptic number.
It is an amenable number.
76148664153 is a deficient number, since it is larger than the sum of its proper divisors (25388257575).
76148664153 is a wasteful number, since it uses less digits than its factorization.
76148664153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1342383.
The product of its digits is 2903040, while the sum is 51.
The spelling of 76148664153 in words is "seventy-six billion, one hundred forty-eight million, six hundred sixty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •