Base | Representation |
---|---|
bin | 110001001100110100… |
… | …0111001111110110001 |
3 | 101002201102000012220121 |
4 | 1202121220321332301 |
5 | 3212341123234101 |
6 | 120312121010241 |
7 | 10430163266362 |
oct | 1423150717661 |
9 | 332642005817 |
10 | 105656852401 |
11 | 408995a2031 |
12 | 18588323981 |
13 | 9c6a781299 |
14 | 5184467b69 |
15 | 2b35b8e0a1 |
hex | 1899a39fb1 |
105656852401 has 9 divisors (see below), whose sum is σ = 107705553249. Its totient is φ = 103646424336.
The previous prime is 105656852377. The next prime is 105656852467. The reversal of 105656852401 is 104258656501.
The square root of 105656852401 is 325049.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 58080518001 + 47576334400 = 240999^2 + 218120^2 .
It is not a de Polignac number, because 105656852401 - 223 = 105648463793 is a prime.
It is a super-2 number, since 2×1056568524012 (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 (105656852101) 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, 17224531 + ... + 17230663.
Almost surely, 2105656852401 is an apocalyptic number.
105656852401 is the 325049-th square number.
105656852401 is the 162525-th centered octagonal number.
It is an amenable number.
105656852401 is a deficient number, since it is larger than the sum of its proper divisors (2048700848).
105656852401 is an frugal number, since it uses more digits than its factorization.
105656852401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12372 (or 6186 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 43.
The spelling of 105656852401 in words is "one hundred five billion, six hundred fifty-six million, eight hundred fifty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •