Base | Representation |
---|---|
bin | 111111011111101… |
… | …110011011001001 |
3 | 2202020111220010012 |
4 | 333133232123021 |
5 | 4140202444400 |
6 | 253412401305 |
7 | 35253512111 |
oct | 7737563311 |
9 | 2666456105 |
10 | 1065281225 |
11 | 4a7361608 |
12 | 258916235 |
13 | 13c915c28 |
14 | a16a2041 |
15 | 637c8d35 |
hex | 3f7ee6c9 |
1065281225 has 12 divisors (see below), whose sum is σ = 1378382016. Its totient is φ = 815171280.
The previous prime is 1065281221. The next prime is 1065281279. The reversal of 1065281225 is 5221825601.
1065281225 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1065281225 - 22 = 1065281221 is a prime.
It is a super-2 number, since 2×10652812252 = 2269648176675001250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1065281191 and 1065281200.
It is not an unprimeable number, because it can be changed into a prime (1065281221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 925757 + ... + 926906.
It is an arithmetic number, because the mean of its divisors is an integer number (114865168).
Almost surely, 21065281225 is an apocalyptic number.
It is an amenable number.
1065281225 is a deficient number, since it is larger than the sum of its proper divisors (313100791).
1065281225 is a wasteful number, since it uses less digits than its factorization.
1065281225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1852696 (or 1852691 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 32.
The square root of 1065281225 is about 32638.6461882229. The cubic root of 1065281225 is about 1021.3033527736.
The spelling of 1065281225 in words is "one billion, sixty-five million, two hundred eighty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •