Base | Representation |
---|---|
bin | 11000010000000000111… |
… | …101001100010101011001 |
3 | 12220022102200210121001120 |
4 | 120100000331030111121 |
5 | 204300404104232103 |
6 | 3313321313035453 |
7 | 231253341530025 |
oct | 30200075142531 |
9 | 5808380717046 |
10 | 1666463352153 |
11 | 59281a1326a6 |
12 | 22ab7b255b89 |
13 | c11ba742252 |
14 | 5a92b725385 |
15 | 2d536499253 |
hex | 18400f4c559 |
1666463352153 has 12 divisors (see below), whose sum is σ = 2360342557680. Its totient is φ = 1045624063552.
The previous prime is 1666463352089. The next prime is 1666463352157. The reversal of 1666463352153 is 3512533646661.
It is not a de Polignac number, because 1666463352153 - 26 = 1666463352089 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 1666463352096 and 1666463352105.
It is not an unprimeable number, because it can be changed into a prime (1666463352157) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 961050663 + ... + 961052396.
It is an arithmetic number, because the mean of its divisors is an integer number (196695213140).
Almost surely, 21666463352153 is an apocalyptic number.
It is an amenable number.
1666463352153 is a deficient number, since it is larger than the sum of its proper divisors (693879205527).
1666463352153 is a wasteful number, since it uses less digits than its factorization.
1666463352153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1922103096 (or 1922103079 counting only the distinct ones).
The product of its digits is 6998400, while the sum is 51.
The spelling of 1666463352153 in words is "one trillion, six hundred sixty-six billion, four hundred sixty-three million, three hundred fifty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •