Base | Representation |
---|---|
bin | 11110000000111011100010… |
… | …10100100110000010000011 |
3 | 22122200210102010002002210110 |
4 | 33000131301110212002003 |
5 | 32122341423344133244 |
6 | 352213112145002403 |
7 | 16621351351255302 |
oct | 1700356124460203 |
9 | 278623363062713 |
10 | 66002663661699 |
11 | 1a037632a50a66 |
12 | 749b912623403 |
13 | 2aaa041a10a6b |
14 | 12427901ba439 |
15 | 796d327e39b9 |
hex | 3c0771526083 |
66002663661699 has 16 divisors (see below), whose sum is σ = 88996753360800. Its totient is φ = 43505223734016.
The previous prime is 66002663661691. The next prime is 66002663661707. The reversal of 66002663661699 is 99616636620066.
It is an interprime number because it is at equal distance from previous prime (66002663661691) and next prime (66002663661707).
It is not a de Polignac number, because 66002663661699 - 23 = 66002663661691 is a prime.
It is a super-2 number, since 2×660026636616992 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (66002663661691) 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 15 ways as a sum of consecutive naturals, for example, 686184 + ... + 11509829.
It is an arithmetic number, because the mean of its divisors is an integer number (5562297085050).
Almost surely, 266002663661699 is an apocalyptic number.
66002663661699 is a deficient number, since it is larger than the sum of its proper divisors (22994089699101).
66002663661699 is a wasteful number, since it uses less digits than its factorization.
66002663661699 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12216374.
The product of its (nonzero) digits is 136048896, while the sum is 66.
The spelling of 66002663661699 in words is "sixty-six trillion, two billion, six hundred sixty-three million, six hundred sixty-one thousand, six hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •