Base | Representation |
---|---|
bin | 11110000100101101011111… |
… | …11000011001110100011011 |
3 | 22200011012200222012100202110 |
4 | 33002112233320121310123 |
5 | 32132003441414131011 |
6 | 352352514002403403 |
7 | 16633630354141551 |
oct | 1702265770316433 |
9 | 280135628170673 |
10 | 66132562255131 |
11 | 1a087731358909 |
12 | 7500b25360563 |
13 | 2ab937389b7b8 |
14 | 1248b94009bd1 |
15 | 79a3d67c5ba6 |
hex | 3c25afe19d1b |
66132562255131 has 8 divisors (see below), whose sum is σ = 88176938695744. Its totient is φ = 44088280325640.
The previous prime is 66132562255117. The next prime is 66132562255141. The reversal of 66132562255131 is 13155226523166.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 66132562255131 - 234 = 66115382385947 is a prime.
It is a super-2 number, since 2×661325622551312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66132562255141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21978625 + ... + 24805746.
It is an arithmetic number, because the mean of its divisors is an integer number (11022117336968).
Almost surely, 266132562255131 is an apocalyptic number.
66132562255131 is a deficient number, since it is larger than the sum of its proper divisors (22044376440613).
66132562255131 is a wasteful number, since it uses less digits than its factorization.
66132562255131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47255561.
The product of its digits is 1944000, while the sum is 48.
Adding to 66132562255131 its reverse (13155226523166), we get a palindrome (79287788778297).
The spelling of 66132562255131 in words is "sixty-six trillion, one hundred thirty-two billion, five hundred sixty-two million, two hundred fifty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •