Base | Representation |
---|---|
bin | 1001011101101010001110… |
… | …0101100001010111101111 |
3 | 1100211201112011102122221201 |
4 | 2113122203211201113233 |
5 | 2330434224230010020 |
6 | 34044021245310331 |
7 | 2122514306601622 |
oct | 227324345412757 |
9 | 40751464378851 |
10 | 10405155313135 |
11 | 335188aa04490 |
12 | 12007095653a7 |
13 | 5a62818647bb |
14 | 27d87dc61db9 |
15 | 1309de221a0a |
hex | 976a39615ef |
10405155313135 has 32 divisors (see below), whose sum is σ = 13660452126720. Its totient is φ = 7545641721600.
The previous prime is 10405155313127. The next prime is 10405155313141. The reversal of 10405155313135 is 53131355150401.
It is not a de Polignac number, because 10405155313135 - 23 = 10405155313127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10405155313094 and 10405155313103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82490715 + ... + 82616755.
It is an arithmetic number, because the mean of its divisors is an integer number (426889128960).
Almost surely, 210405155313135 is an apocalyptic number.
10405155313135 is a deficient number, since it is larger than the sum of its proper divisors (3255296813585).
10405155313135 is a wasteful number, since it uses less digits than its factorization.
10405155313135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130359.
The product of its (nonzero) digits is 67500, while the sum is 37.
The spelling of 10405155313135 in words is "ten trillion, four hundred five billion, one hundred fifty-five million, three hundred thirteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •