Base | Representation |
---|---|
bin | 11010001100111001… |
… | …00001111100100101 |
3 | 1100022100010202212020 |
4 | 31012130201330211 |
5 | 212302044123320 |
6 | 10243500013353 |
7 | 1005405465102 |
oct | 150634417445 |
9 | 40270122766 |
10 | 14066786085 |
11 | 5a69374650 |
12 | 2886b31259 |
13 | 14323c3881 |
14 | 9762ddaa9 |
15 | 574e26940 |
hex | 346721f25 |
14066786085 has 128 divisors (see below), whose sum is σ = 27250089984. Its totient is φ = 6112296960.
The previous prime is 14066786029. The next prime is 14066786093. The reversal of 14066786085 is 58068766041.
14066786085 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14066786085 - 215 = 14066753317 is a prime.
It is a super-2 number, since 2×140667860852 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 21741232 + ... + 21741878.
It is an arithmetic number, because the mean of its divisors is an integer number (212891328).
Almost surely, 214066786085 is an apocalyptic number.
14066786085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14066786085 is a deficient number, since it is larger than the sum of its proper divisors (13183303899).
14066786085 is a wasteful number, since it uses less digits than its factorization.
14066786085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1043.
The product of its (nonzero) digits is 1935360, while the sum is 51.
The spelling of 14066786085 in words is "fourteen billion, sixty-six million, seven hundred eighty-six thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •