Base | Representation |
---|---|
bin | 1001100110000110000001… |
… | …0010001100010000010101 |
3 | 1101100120112110212111111120 |
4 | 2121201200102030100111 |
5 | 2340323003043414001 |
6 | 34234343421554153 |
7 | 2136134125251645 |
oct | 231414022142025 |
9 | 41316473774446 |
10 | 10550055060501 |
11 | 33a8287051310 |
12 | 1224808115959 |
13 | 5b6b34583898 |
14 | 2868a80d6525 |
15 | 134670195236 |
hex | 9986048c415 |
10550055060501 has 16 divisors (see below), whose sum is σ = 15378678359040. Its totient is φ = 6380162878320.
The previous prime is 10550055060497. The next prime is 10550055060511. The reversal of 10550055060501 is 10506055005501.
It is not a de Polignac number, because 10550055060501 - 22 = 10550055060497 is a prime.
It is a super-2 number, since 2×105500550605012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10550055060511) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 345231631 + ... + 345262188.
It is an arithmetic number, because the mean of its divisors is an integer number (961167397440).
Almost surely, 210550055060501 is an apocalyptic number.
10550055060501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10550055060501 is a deficient number, since it is larger than the sum of its proper divisors (4828623298539).
10550055060501 is a wasteful number, since it uses less digits than its factorization.
10550055060501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690494296.
The product of its (nonzero) digits is 18750, while the sum is 33.
The spelling of 10550055060501 in words is "ten trillion, five hundred fifty billion, fifty-five million, sixty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •