Base | Representation |
---|---|
bin | 111101011110100000… |
… | …110001110000010111 |
3 | 20022101100202120112100 |
4 | 331132200301300113 |
5 | 2040142100111101 |
6 | 50154042453143 |
7 | 4524536050335 |
oct | 753640616027 |
9 | 208340676470 |
10 | 66010160151 |
11 | 25aa4018371 |
12 | 109628041b3 |
13 | 62bc972680 |
14 | 32a2b88b55 |
15 | 1ab51e5e86 |
hex | f5e831c17 |
66010160151 has 48 divisors (see below), whose sum is σ = 106285888800. Its totient is φ = 39197765376.
The previous prime is 66010160071. The next prime is 66010160159. The reversal of 66010160151 is 15106101066.
66010160151 is a `hidden beast` number, since 6 + 6 + 0 + 1 + 0 + 1 + 601 + 51 = 666.
It is not a de Polignac number, because 66010160151 - 235 = 31650421783 is a prime.
It is a super-3 number, since 3×660101601513 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66010160159) 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 47 ways as a sum of consecutive naturals, for example, 7015416 + ... + 7024818.
It is an arithmetic number, because the mean of its divisors is an integer number (2214289350).
Almost surely, 266010160151 is an apocalyptic number.
66010160151 is a deficient number, since it is larger than the sum of its proper divisors (40275728649).
66010160151 is a wasteful number, since it uses less digits than its factorization.
66010160151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11520 (or 11517 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The spelling of 66010160151 in words is "sixty-six billion, ten million, one hundred sixty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •