Base | Representation |
---|---|
bin | 1001100110011010010101… |
… | …1101000100000000010101 |
3 | 1101101002121200020211010210 |
4 | 2121212211131010000111 |
5 | 2340420141142133433 |
6 | 34241045023040033 |
7 | 2136416250624252 |
oct | 231464535040025 |
9 | 41332550224123 |
10 | 10555510505493 |
11 | 33aa626553938 |
12 | 122588b140019 |
13 | 5b74c3897645 |
14 | 286c64872429 |
15 | 13488e0b3463 |
hex | 999a5744015 |
10555510505493 has 8 divisors (see below), whose sum is σ = 14113217390400. Its totient is φ = 7017405312128.
The previous prime is 10555510505489. The next prime is 10555510505521. The reversal of 10555510505493 is 39450501555501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10555510505493 - 22 = 10555510505489 is a prime.
It is a super-5 number, since 5×105555105054935 (a number of 66 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10555510505473) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4900421628 + ... + 4900423781.
It is an arithmetic number, because the mean of its divisors is an integer number (1764152173800).
Almost surely, 210555510505493 is an apocalyptic number.
It is an amenable number.
10555510505493 is a deficient number, since it is larger than the sum of its proper divisors (3557706884907).
10555510505493 is an equidigital number, since it uses as much as digits as its factorization.
10555510505493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9800845771.
The product of its (nonzero) digits is 1687500, while the sum is 48.
The spelling of 10555510505493 in words is "ten trillion, five hundred fifty-five billion, five hundred ten million, five hundred five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •