Base | Representation |
---|---|
bin | 10010101111111101… |
… | …10100100100011001 |
3 | 221222111222211102000 |
4 | 21113332310210121 |
5 | 131103400130013 |
6 | 4342501431213 |
7 | 504305522634 |
oct | 112776644431 |
9 | 27874884360 |
10 | 10066020633 |
11 | 42a6008319 |
12 | 1b4b10b509 |
13 | c45594936 |
14 | 6b6c2ac1b |
15 | 3dda9e973 |
hex | 257fb4919 |
10066020633 has 32 divisors (see below), whose sum is σ = 16062996480. Its totient is φ = 6211838160.
The previous prime is 10066020623. The next prime is 10066020647. The reversal of 10066020633 is 33602066001.
10066020633 is a `hidden beast` number, since 1 + 0 + 0 + 6 + 6 + 0 + 20 + 633 = 666.
It is not a de Polignac number, because 10066020633 - 210 = 10066019609 is a prime.
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 = 10066020597 and 10066020606.
It is not an unprimeable number, because it can be changed into a prime (10066020623) 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 31 ways as a sum of consecutive naturals, for example, 242191 + ... + 280692.
It is an arithmetic number, because the mean of its divisors is an integer number (501968640).
Almost surely, 210066020633 is an apocalyptic number.
It is an amenable number.
10066020633 is a deficient number, since it is larger than the sum of its proper divisors (5996975847).
10066020633 is a wasteful number, since it uses less digits than its factorization.
10066020633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522946 (or 522940 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 10066020633 its reverse (33602066001), we get a palindrome (43668086634).
The spelling of 10066020633 in words is "ten billion, sixty-six million, twenty thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •