Base | Representation |
---|---|
bin | 1001100001101011100111… |
… | …1111011101101100100001 |
3 | 1101002022212112120110020022 |
4 | 2120122321333131230201 |
5 | 2333102231134024223 |
6 | 34135445423123225 |
7 | 2130511460604215 |
oct | 230327177355441 |
9 | 41068775513208 |
10 | 10474250689313 |
11 | 33791174a6264 |
12 | 1211b91443515 |
13 | 5ac943756c88 |
14 | 282d56676945 |
15 | 1326d51e0ac8 |
hex | 986b9fddb21 |
10474250689313 has 16 divisors (see below), whose sum is σ = 11119707378000. Its totient is φ = 9832055980032.
The previous prime is 10474250689307. The next prime is 10474250689327. The reversal of 10474250689313 is 31398605247401.
It can be written as a sum of positive squares in 8 ways, for example, as 2085447915664 + 8388802773649 = 1444108^2 + 2896343^2 .
It is a cyclic number.
It is not a de Polignac number, because 10474250689313 - 26 = 10474250689249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10474250689373) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104494823 + ... + 104595011.
It is an arithmetic number, because the mean of its divisors is an integer number (694981711125).
It is a 2-persistent number, because it is pandigital, and so is 2⋅10474250689313 = 20948501378626, but 3⋅10474250689313 = 31422752067939 is not.
Almost surely, 210474250689313 is an apocalyptic number.
It is an amenable number.
10474250689313 is a deficient number, since it is larger than the sum of its proper divisors (645456688687).
10474250689313 is a wasteful number, since it uses less digits than its factorization.
10474250689313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116404.
The product of its (nonzero) digits is 4354560, while the sum is 53.
The spelling of 10474250689313 in words is "ten trillion, four hundred seventy-four billion, two hundred fifty million, six hundred eighty-nine thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •