Base | Representation |
---|---|
bin | 1001101100011111111111… |
… | …0001011111001001111101 |
3 | 1101202002121001021220002020 |
4 | 2123013333301133021331 |
5 | 2344123343341233000 |
6 | 34401103514350353 |
7 | 2150111224435644 |
oct | 233077761371175 |
9 | 41662531256066 |
10 | 10660105024125 |
11 | 343aa1a417877 |
12 | 1241bbb72b3b9 |
13 | 5c432222545b |
14 | 28bd47ba435b |
15 | 13746185bba0 |
hex | 9b1ffc5f27d |
10660105024125 has 32 divisors (see below), whose sum is σ = 17741330795136. Its totient is φ = 5684454720000.
The previous prime is 10660105024117. The next prime is 10660105024141. The reversal of 10660105024125 is 52142050106601.
It is not a de Polignac number, because 10660105024125 - 23 = 10660105024117 is a prime.
It is a super-2 number, since 2×106601050241252 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49396 + ... + 4617645.
It is an arithmetic number, because the mean of its divisors is an integer number (554416587348).
Almost surely, 210660105024125 is an apocalyptic number.
10660105024125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10660105024125 is a deficient number, since it is larger than the sum of its proper divisors (7081225771011).
10660105024125 is an equidigital number, since it uses as much as digits as its factorization.
10660105024125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4673150 (or 4673140 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
The spelling of 10660105024125 in words is "ten trillion, six hundred sixty billion, one hundred five million, twenty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •