Base | Representation |
---|---|
bin | 111101000111001… |
… | …000100110010000 |
3 | 2122110020122022011 |
4 | 331013020212100 |
5 | 4044432433100 |
6 | 245423152304 |
7 | 34256511454 |
oct | 7507104620 |
9 | 2573218264 |
10 | 1025280400 |
11 | 486820381 |
12 | 247445694 |
13 | 13454bbc1 |
14 | 9a24c664 |
15 | 60026bba |
hex | 3d1c8990 |
1025280400 has 45 divisors (see below), whose sum is σ = 2464775683. Its totient is φ = 409856000.
The previous prime is 1025280379. The next prime is 1025280427. The reversal of 1025280400 is 40825201.
The square root of 1025280400 is 32020.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 320696464 + 704583936 = 17908^2 + 26544^2 .
It is a super-3 number, since 3×10252804003 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 639600 + ... + 641200.
Almost surely, 21025280400 is an apocalyptic number.
1025280400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1025280400 is the 32020-th square number.
It is an amenable number.
1025280400 is an abundant number, since it is smaller than the sum of its proper divisors (1439495283).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025280400 is an frugal number, since it uses more digits than its factorization.
1025280400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3220 (or 1608 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 22.
The cubic root of 1025280400 is about 1008.3567698641.
The spelling of 1025280400 in words is "one billion, twenty-five million, two hundred eighty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •