Base | Representation |
---|---|
bin | 1001001110001110101001… |
… | …1001010101111011100111 |
3 | 1022220101020220001012210122 |
4 | 2103203222121111323213 |
5 | 2312113313131034120 |
6 | 33322135504512155 |
7 | 2064411011122154 |
oct | 223435231257347 |
9 | 38811226035718 |
10 | 10140055330535 |
11 | 325a411979879 |
12 | 117926401b65b |
13 | 587284320c80 |
14 | 270ad1c4122b |
15 | 128b75943a25 |
hex | 938ea655ee7 |
10140055330535 has 32 divisors (see below), whose sum is σ = 13410747237888. Its totient is φ = 7312847713920.
The previous prime is 10140055330487. The next prime is 10140055330579. The reversal of 10140055330535 is 53503355004101.
It is not a de Polignac number, because 10140055330535 - 212 = 10140055326439 is a prime.
It is a super-2 number, since 2×101400553305352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10140055330495 and 10140055330504.
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, 19427630 + ... + 19942740.
It is an arithmetic number, because the mean of its divisors is an integer number (419085851184).
Almost surely, 210140055330535 is an apocalyptic number.
10140055330535 is a deficient number, since it is larger than the sum of its proper divisors (3270691907353).
10140055330535 is a wasteful number, since it uses less digits than its factorization.
10140055330535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522215.
The product of its (nonzero) digits is 67500, while the sum is 35.
The spelling of 10140055330535 in words is "ten trillion, one hundred forty billion, fifty-five million, three hundred thirty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •