Base | Representation |
---|---|
bin | 1001100011100000000010… |
… | …1000010000110001110101 |
3 | 1101012022112101201101112220 |
4 | 2120320000220100301311 |
5 | 2334110231120414001 |
6 | 34202054344232553 |
7 | 2132666045251332 |
oct | 230700050206165 |
9 | 41168471641486 |
10 | 10505500560501 |
11 | 33903a3208a91 |
12 | 1218052a6b759 |
13 | 5b2883a5510b |
14 | 28467cab3989 |
15 | 133413906c36 |
hex | 98e00a10c75 |
10505500560501 has 4 divisors (see below), whose sum is σ = 14007334080672. Its totient is φ = 7003667040332.
The previous prime is 10505500560473. The next prime is 10505500560509. The reversal of 10505500560501 is 10506500550501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10505500560501 - 25 = 10505500560469 is a prime.
It is a super-2 number, since 2×105055005605012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10505500560509) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1750916760081 + ... + 1750916760086.
It is an arithmetic number, because the mean of its divisors is an integer number (3501833520168).
Almost surely, 210505500560501 is an apocalyptic number.
It is an amenable number.
10505500560501 is a deficient number, since it is larger than the sum of its proper divisors (3501833520171).
10505500560501 is an equidigital number, since it uses as much as digits as its factorization.
10505500560501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3501833520170.
The product of its (nonzero) digits is 18750, while the sum is 33.
The spelling of 10505500560501 in words is "ten trillion, five hundred five billion, five hundred million, five hundred sixty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •