Base | Representation |
---|---|
bin | 111101011110110… |
… | …100101101100000 |
3 | 2122212221010211011 |
4 | 331132310231200 |
5 | 4103030143100 |
6 | 250204230304 |
7 | 34363344433 |
oct | 7536645540 |
9 | 2585833734 |
10 | 1031490400 |
11 | 48a282006 |
12 | 24953b394 |
13 | 135914665 |
14 | 9adc781a |
15 | 60851bba |
hex | 3d7b4b60 |
1031490400 has 36 divisors (see below), whose sum is σ = 2518127892. Its totient is φ = 412595840.
The previous prime is 1031490391. The next prime is 1031490409. The reversal of 1031490400 is 40941301.
It is an interprime number because it is at equal distance from previous prime (1031490391) and next prime (1031490409).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031490409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 643882 + ... + 645481.
It is an arithmetic number, because the mean of its divisors is an integer number (69947997).
Almost surely, 21031490400 is an apocalyptic number.
1031490400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031490400 is an abundant number, since it is smaller than the sum of its proper divisors (1486637492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031490400 is a wasteful number, since it uses less digits than its factorization.
1031490400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289383 (or 1289370 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 1031490400 is about 32116.8242514729. The cubic root of 1031490400 is about 1010.3885052460.
The spelling of 1031490400 in words is "one billion, thirty-one million, four hundred ninety thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •