Base | Representation |
---|---|
bin | 1001101110000100101011… |
… | …1000101011101101011111 |
3 | 1101211200100210222012212211 |
4 | 2123201022320223231133 |
5 | 2400044223030134120 |
6 | 34421334012541251 |
7 | 2152056111462322 |
oct | 233411270535537 |
9 | 41750323865784 |
10 | 10687135005535 |
11 | 345043010898a |
12 | 12472a3a81827 |
13 | 5c6a3c1a26b1 |
14 | 28d38d9ac7b9 |
15 | 137ee486525a |
hex | 9b84ae2bb5f |
10687135005535 has 16 divisors (see below), whose sum is σ = 13528822174560. Its totient is φ = 8082153440640.
The previous prime is 10687135005499. The next prime is 10687135005553. The reversal of 10687135005535 is 53550053178601.
It is not a de Polignac number, because 10687135005535 - 211 = 10687135003487 is a prime.
It is a super-2 number, since 2×106871350055352 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 121969392 + ... + 122056981.
It is an arithmetic number, because the mean of its divisors is an integer number (845551385910).
Almost surely, 210687135005535 is an apocalyptic number.
10687135005535 is a deficient number, since it is larger than the sum of its proper divisors (2841687169025).
10687135005535 is a wasteful number, since it uses less digits than its factorization.
10687135005535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244026858.
The product of its (nonzero) digits is 1890000, while the sum is 49.
The spelling of 10687135005535 in words is "ten trillion, six hundred eighty-seven billion, one hundred thirty-five million, five thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •