Base | Representation |
---|---|
bin | 11110111110000010111… |
… | …11100100110110110001 |
3 | 10202201122011220111112001 |
4 | 33133001133210312301 |
5 | 114413240404432400 |
6 | 2132501532334001 |
7 | 136610316660310 |
oct | 17370137446661 |
9 | 3681564814461 |
10 | 1064103202225 |
11 | 380313575578 |
12 | 152292014301 |
13 | 79462b3c62b |
14 | 39707c36277 |
15 | 1ca2e327a6a |
hex | f7c17e4db1 |
1064103202225 has 24 divisors (see below), whose sum is σ = 1508190487488. Its totient is φ = 729571944000.
The previous prime is 1064103202223. The next prime is 1064103202291. The reversal of 1064103202225 is 5222023014601.
It is not a de Polignac number, because 1064103202225 - 21 = 1064103202223 is a prime.
It is a super-2 number, since 2×10641032022252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1064103202193 and 1064103202202.
It is not an unprimeable number, because it can be changed into a prime (1064103202223) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 895887 + ... + 1711963.
It is an arithmetic number, because the mean of its divisors is an integer number (62841270312).
Almost surely, 21064103202225 is an apocalyptic number.
It is an amenable number.
1064103202225 is a deficient number, since it is larger than the sum of its proper divisors (444087285263).
1064103202225 is an equidigital number, since it uses as much as digits as its factorization.
1064103202225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 823545 (or 823540 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 1064103202225 its reverse (5222023014601), we get a palindrome (6286126216826).
The spelling of 1064103202225 in words is "one trillion, sixty-four billion, one hundred three million, two hundred two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •