Base | Representation |
---|---|
bin | 111110001010001101… |
… | …111101111001011011 |
3 | 20101021110112101001212 |
4 | 332022031331321123 |
5 | 2043142304123101 |
6 | 50354515133335 |
7 | 4551651523466 |
oct | 761215757133 |
9 | 211243471055 |
10 | 66743426651 |
11 | 2633aa19340 |
12 | 10b282a424b |
13 | 63a885b785 |
14 | 33323022dd |
15 | 1b0978a1bb |
hex | f8a37de5b |
66743426651 has 16 divisors (see below), whose sum is σ = 76914061440. Its totient is φ = 57279208320.
The previous prime is 66743426647. The next prime is 66743426669. The reversal of 66743426651 is 15662434766.
It is a cyclic number.
It is not a de Polignac number, because 66743426651 - 22 = 66743426647 is a prime.
It is a super-2 number, since 2×667434266512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 66743426651.
It is not an unprimeable number, because it can be changed into a prime (66743426671) 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 15 ways as a sum of consecutive naturals, for example, 505070 + ... + 623363.
It is an arithmetic number, because the mean of its divisors is an integer number (4807128840).
Almost surely, 266743426651 is an apocalyptic number.
66743426651 is a deficient number, since it is larger than the sum of its proper divisors (10170634789).
66743426651 is a wasteful number, since it uses less digits than its factorization.
66743426651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128746.
The product of its digits is 4354560, while the sum is 50.
It can be divided in two parts, 66743 and 426651, that added together give a palindrome (493394).
The spelling of 66743426651 in words is "sixty-six billion, seven hundred forty-three million, four hundred twenty-six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •