Base | Representation |
---|---|
bin | 1111110101011… |
… | …0110110011111 |
3 | 11121222021200000 |
4 | 3331112312133 |
5 | 114000303111 |
6 | 10331305343 |
7 | 1434345513 |
oct | 375266637 |
9 | 147867600 |
10 | 66416031 |
11 | 34543390 |
12 | 1a2ab253 |
13 | 109b5436 |
14 | 8b6c143 |
15 | 5c6dc56 |
hex | 3f56d9f |
66416031 has 24 divisors (see below), whose sum is σ = 108536064. Its totient is φ = 40250520.
The previous prime is 66416017. The next prime is 66416041. The reversal of 66416031 is 13061466.
It is not a de Polignac number, because 66416031 - 26 = 66415967 is a prime.
It is a super-2 number, since 2×664160312 = 8822178347585922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 66415986 and 66416004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66416041) 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 23 ways as a sum of consecutive naturals, for example, 9751 + ... + 15096.
It is an arithmetic number, because the mean of its divisors is an integer number (4522336).
Almost surely, 266416031 is an apocalyptic number.
66416031 is a deficient number, since it is larger than the sum of its proper divisors (42120033).
66416031 is a wasteful number, since it uses less digits than its factorization.
66416031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24873 (or 24861 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 66416031 is about 8149.6031191709. The cubic root of 66416031 is about 404.9713559989.
Adding to 66416031 its reverse (13061466), we get a palindrome (79477497).
The spelling of 66416031 in words is "sixty-six million, four hundred sixteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •