Base | Representation |
---|---|
bin | 111101111001011001… |
… | …110110111110000101 |
3 | 20100112210201110001010 |
4 | 331321121312332011 |
5 | 2042103100100313 |
6 | 50310520552433 |
7 | 4541654665245 |
oct | 757131667605 |
9 | 210483643033 |
10 | 66461331333 |
11 | 26205763a11 |
12 | 10a69922719 |
13 | 636228c477 |
14 | 3306a6db25 |
15 | 1adeb164c3 |
hex | f79676f85 |
66461331333 has 16 divisors (see below), whose sum is σ = 93362659520. Its totient is φ = 41937958656.
The previous prime is 66461331329. The next prime is 66461331341. The reversal of 66461331333 is 33313316466.
It is not a de Polignac number, because 66461331333 - 22 = 66461331329 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66461331291 and 66461331300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66461331353) 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, 458260 + ... + 585597.
It is an arithmetic number, because the mean of its divisors is an integer number (5835166220).
Almost surely, 266461331333 is an apocalyptic number.
It is an amenable number.
66461331333 is a deficient number, since it is larger than the sum of its proper divisors (26901328187).
66461331333 is a wasteful number, since it uses less digits than its factorization.
66461331333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1044996.
The product of its digits is 209952, while the sum is 39.
Adding to 66461331333 its reverse (33313316466), we get a palindrome (99774647799).
It can be divided in two parts, 6646133 and 1333, that added together give a palindrome (6647466).
The spelling of 66461331333 in words is "sixty-six billion, four hundred sixty-one million, three hundred thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •