Base | Representation |
---|---|
bin | 110001011110111110… |
… | …1011101011011000001 |
3 | 101011021212122022102021 |
4 | 1202331331131123001 |
5 | 3220113123021400 |
6 | 120452405521441 |
7 | 10451242653064 |
oct | 1427575353301 |
9 | 334255568367 |
10 | 106266220225 |
11 | 41081569100 |
12 | 18718413281 |
13 | a036aa9a69 |
14 | 520136c8db |
15 | 2b6e40c71a |
hex | 18bdf5d6c1 |
106266220225 has 27 divisors (see below), whose sum is σ = 144862664611. Its totient is φ = 77271484400.
The previous prime is 106266220199. The next prime is 106266220273. The reversal of 106266220225 is 522022662601.
The square root of 106266220225 is 325985.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 38255839281 + 68010380944 = 195591^2 + 260788^2 .
It is not a de Polignac number, because 106266220225 - 219 = 106265695937 is a prime.
It is a super-2 number, since 2×1062662202252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
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, 17926212 + ... + 17932138.
Almost surely, 2106266220225 is an apocalyptic number.
106266220225 is the 325985-th square number.
106266220225 is the 162993-rd centered octagonal number.
It is an amenable number.
106266220225 is a deficient number, since it is larger than the sum of its proper divisors (38596444386).
106266220225 is an frugal number, since it uses more digits than its factorization.
106266220225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11886 (or 5943 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 106266220225 its reverse (522022662601), we get a palindrome (628288882826).
The spelling of 106266220225 in words is "one hundred six billion, two hundred sixty-six million, two hundred twenty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •