Base | Representation |
---|---|
bin | 1001100110011000110100… |
… | …0010111011000110101111 |
3 | 1101101001120010200210100210 |
4 | 2121212031002323012233 |
5 | 2340413321324000421 |
6 | 34240540233553503 |
7 | 2136403146113103 |
oct | 231461502730657 |
9 | 41331503623323 |
10 | 10555101000111 |
11 | 33aa436386438 |
12 | 1225795b75893 |
13 | 5b7459aa8675 |
14 | 286c26315903 |
15 | 134868173576 |
hex | 9998d0bb1af |
10555101000111 has 32 divisors (see below), whose sum is σ = 14475360639168. Its totient is φ = 6836359495680.
The previous prime is 10555101000089. The next prime is 10555101000113. The reversal of 10555101000111 is 11100010155501.
It is not a de Polignac number, because 10555101000111 - 215 = 10555100967343 is a prime.
It is a super-2 number, since 2×105551010001112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10555101000113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 326554831 + ... + 326587151.
It is an arithmetic number, because the mean of its divisors is an integer number (452355019974).
Almost surely, 210555101000111 is an apocalyptic number.
10555101000111 is a deficient number, since it is larger than the sum of its proper divisors (3920259639057).
10555101000111 is a wasteful number, since it uses less digits than its factorization.
10555101000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36651.
The product of its (nonzero) digits is 125, while the sum is 21.
Adding to 10555101000111 its reverse (11100010155501), we get a palindrome (21655111155612).
The spelling of 10555101000111 in words is "ten trillion, five hundred fifty-five billion, one hundred one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •