Base | Representation |
---|---|
bin | 110001100110010111… |
… | …1000110001011001001 |
3 | 101011221011002120200111 |
4 | 1203030233012023021 |
5 | 3221120103110400 |
6 | 120533143034321 |
7 | 10460343011152 |
oct | 1431457061311 |
9 | 334834076614 |
10 | 106514113225 |
11 | 41199492853 |
12 | 1878743b9a1 |
13 | a076262400 |
14 | 522625a929 |
15 | 2b860773ba |
hex | 18ccbc62c9 |
106514113225 has 27 divisors (see below), whose sum is σ = 143047321599. Its totient is φ = 78640910400.
The previous prime is 106514113217. The next prime is 106514113231. The reversal of 106514113225 is 522311415601.
The square root of 106514113225 is 326365.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 59510138809 + 47003974416 = 243947^2 + 216804^2 .
It is not a de Polignac number, because 106514113225 - 23 = 106514113217 is a prime.
It is a super-2 number, since 2×1065141132252 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 21211215 + ... + 21216235.
Almost surely, 2106514113225 is an apocalyptic number.
106514113225 is the 326365-th square number.
106514113225 is the 163183-rd centered octagonal number.
It is an amenable number.
106514113225 is a deficient number, since it is larger than the sum of its proper divisors (36533208374).
106514113225 is an frugal number, since it uses more digits than its factorization.
106514113225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10078 (or 5039 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 106514113225 its reverse (522311415601), we get a palindrome (628825528826).
The spelling of 106514113225 in words is "one hundred six billion, five hundred fourteen million, one hundred thirteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •