Base | Representation |
---|---|
bin | 100000000100011… |
… | …1000111100100001 |
3 | 2202222211010120212 |
4 | 1000020320330201 |
5 | 4200433302400 |
6 | 254435543505 |
7 | 35444314544 |
oct | 10010707441 |
9 | 2688733525 |
10 | 1076072225 |
11 | 502461a98 |
12 | 26045ab95 |
13 | 141c23837 |
14 | a2cb085b |
15 | 6470b335 |
hex | 40238f21 |
1076072225 has 6 divisors (see below), whose sum is σ = 1334329590. Its totient is φ = 860857760.
The previous prime is 1076072213. The next prime is 1076072243. The reversal of 1076072225 is 5222706701.
It can be written as a sum of positive squares in 3 ways, for example, as 14876449 + 1061195776 = 3857^2 + 32576^2 .
It is not a de Polignac number, because 1076072225 - 26 = 1076072161 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1076072191 and 1076072200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 21521420 + ... + 21521469.
It is an arithmetic number, because the mean of its divisors is an integer number (222388265).
Almost surely, 21076072225 is an apocalyptic number.
It is an amenable number.
1076072225 is a deficient number, since it is larger than the sum of its proper divisors (258257365).
1076072225 is an equidigital number, since it uses as much as digits as its factorization.
1076072225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43042899 (or 43042894 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 32.
The square root of 1076072225 is about 32803.5398242324. The cubic root of 1076072225 is about 1024.7402792286.
Adding to 1076072225 its reverse (5222706701), we get a palindrome (6298778926).
The spelling of 1076072225 in words is "one billion, seventy-six million, seventy-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •