Base | Representation |
---|---|
bin | 110001000010001100… |
… | …0011110110111100001 |
3 | 101001210112221200210001 |
4 | 1202010120132313201 |
5 | 3211123324204010 |
6 | 120212501140001 |
7 | 10415303101666 |
oct | 1420430366741 |
9 | 331715850701 |
10 | 105300225505 |
11 | 40726260a62 |
12 | 184a89ba601 |
13 | 9c11917957 |
14 | 514cd53a6d |
15 | 2b146e6c3a |
hex | 188461ede1 |
105300225505 has 12 divisors (see below), whose sum is σ = 128465731836. Its totient is φ = 82859179200.
The previous prime is 105300225497. The next prime is 105300225509. The reversal of 105300225505 is 505522003501.
It can be written as a sum of positive squares in 6 ways, for example, as 65311424721 + 39988800784 = 255561^2 + 199972^2 .
It is not a de Polignac number, because 105300225505 - 23 = 105300225497 is a prime.
It is a super-2 number, since 2×1053002255052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105300225509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2811286 + ... + 2848495.
It is an arithmetic number, because the mean of its divisors is an integer number (10705477653).
Almost surely, 2105300225505 is an apocalyptic number.
It is an amenable number.
105300225505 is a deficient number, since it is larger than the sum of its proper divisors (23165506331).
105300225505 is an frugal number, since it uses more digits than its factorization.
105300225505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5659908 (or 5659847 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 28.
The spelling of 105300225505 in words is "one hundred five billion, three hundred million, two hundred twenty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •