Base | Representation |
---|---|
bin | 1001101100100001101101… |
… | …1111000011010001110101 |
3 | 1101202010210110010202010220 |
4 | 2123020123133003101311 |
5 | 2344130321402002042 |
6 | 34401222003404553 |
7 | 2150125601324610 |
oct | 233103337032165 |
9 | 41663713122126 |
10 | 10660569953397 |
11 | 3440138900041 |
12 | 124210b383759 |
13 | 5c439764b530 |
14 | 28bd8d82b177 |
15 | 13748c5988ec |
hex | 9b21b7c3475 |
10660569953397 has 32 divisors (see below), whose sum is σ = 17558823260160. Its totient is φ = 5602408079040.
The previous prime is 10660569953389. The next prime is 10660569953443. The reversal of 10660569953397 is 79335996506601.
It is a happy number.
It is not a de Polignac number, because 10660569953397 - 23 = 10660569953389 is a prime.
It is a super-2 number, since 2×106605699533972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10660569953347) 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 31 ways as a sum of consecutive naturals, for example, 71973447 + ... + 72121412.
It is an arithmetic number, because the mean of its divisors is an integer number (548713226880).
Almost surely, 210660569953397 is an apocalyptic number.
It is an amenable number.
10660569953397 is a deficient number, since it is larger than the sum of its proper divisors (6898253306763).
10660569953397 is a wasteful number, since it uses less digits than its factorization.
10660569953397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144095153.
The product of its (nonzero) digits is 248005800, while the sum is 69.
The spelling of 10660569953397 in words is "ten trillion, six hundred sixty billion, five hundred sixty-nine million, nine hundred fifty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •