Base | Representation |
---|---|
bin | 110000000000110010… |
… | …1100111001100101001 |
3 | 100212010121211222111201 |
4 | 1200001211213030221 |
5 | 3142130044232301 |
6 | 115211032124201 |
7 | 10310026166122 |
oct | 1400145471451 |
9 | 325117758451 |
10 | 103105852201 |
11 | 3a7aa624900 |
12 | 17b95b36661 |
13 | 9952106401 |
14 | 4dc173d049 |
15 | 2a36c3c201 |
hex | 1801967329 |
103105852201 has 9 divisors (see below), whose sum is σ = 113335108509. Its totient is φ = 93729381900.
The previous prime is 103105852147. The next prime is 103105852217. The reversal of 103105852201 is 102258501301.
The square root of 103105852201 is 321101.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 103105852201 - 221 = 103103755049 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103105852201.
It is not an unprimeable number, because it can be changed into a prime (103105852301) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3517516 + ... + 3546706.
Almost surely, 2103105852201 is an apocalyptic number.
103105852201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103105852201 is the 321101-st square number.
103105852201 is the 160551-st centered octagonal number.
It is an amenable number.
103105852201 is a deficient number, since it is larger than the sum of its proper divisors (10229256308).
103105852201 is an frugal number, since it uses more digits than its factorization.
103105852201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58404 (or 29202 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
The spelling of 103105852201 in words is "one hundred three billion, one hundred five million, eight hundred fifty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •