Base | Representation |
---|---|
bin | 1001100011011110011001… |
… | …1011110110101111010101 |
3 | 1101012021101202210111202121 |
4 | 2120313212123312233111 |
5 | 2334103331120204001 |
6 | 34201543005135541 |
7 | 2132652131021002 |
oct | 230674633665725 |
9 | 41167352714677 |
10 | 10505061100501 |
11 | 3390198141200 |
12 | 1217b4b85a5b1 |
13 | 5b28139a8a06 |
14 | 28463a59a8a9 |
15 | 1333da04b6a1 |
hex | 98de66f6bd5 |
10505061100501 has 6 divisors (see below), whose sum is σ = 11546885342006. Its totient is φ = 9550055545800.
The previous prime is 10505061100487. The next prime is 10505061100511. The reversal of 10505061100501 is 10500116050501.
It can be written as a sum of positive squares in only one way, i.e., 10446948766276 + 58112334225 = 3232174^2 + 241065^2 .
It is not a de Polignac number, because 10505061100501 - 223 = 10505052711893 is a prime.
It is a super-2 number, since 2×105050611005012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10505061100511) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 43409343270 + ... + 43409343511.
Almost surely, 210505061100501 is an apocalyptic number.
10505061100501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10505061100501 is a deficient number, since it is larger than the sum of its proper divisors (1041824241505).
10505061100501 is an equidigital number, since it uses as much as digits as its factorization.
10505061100501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86818686803 (or 86818686792 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 10505061100501 in words is "ten trillion, five hundred five billion, sixty-one million, one hundred thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •