Base | Representation |
---|---|
bin | 1001000110010111111011… |
… | …0000000001011010110101 |
3 | 1022102110220222211220212110 |
4 | 2101211332300001122311 |
5 | 2302410423432202300 |
6 | 33140140522241233 |
7 | 2051562560166501 |
oct | 221457660013265 |
9 | 38373828756773 |
10 | 10005105350325 |
11 | 3208161157308 |
12 | 1157081656219 |
13 | 577628a81c87 |
14 | 26836d1b5301 |
15 | 1253c8259550 |
hex | 9197ec016b5 |
10005105350325 has 24 divisors (see below), whose sum is σ = 16615952566528. Its totient is φ = 5312127674880.
The previous prime is 10005105350309. The next prime is 10005105350329. The reversal of 10005105350325 is 52305350150001.
It is not a de Polignac number, because 10005105350325 - 24 = 10005105350309 is a prime.
It is a super-2 number, since 2×100051053503252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10005105350292 and 10005105350301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10005105350329) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 299089564 + ... + 299123013.
Almost surely, 210005105350325 is an apocalyptic number.
10005105350325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10005105350325 is a deficient number, since it is larger than the sum of its proper divisors (6610847216203).
10005105350325 is a wasteful number, since it uses less digits than its factorization.
10005105350325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598212813 (or 598212808 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 30.
The spelling of 10005105350325 in words is "ten trillion, five billion, one hundred five million, three hundred fifty thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •