Base | Representation |
---|---|
bin | 10010101000011101… |
… | …00111111101000000 |
3 | 221211010111210222022 |
4 | 21110032213331000 |
5 | 130441240220100 |
6 | 4332332101012 |
7 | 502612362623 |
oct | 112416477500 |
9 | 27733453868 |
10 | 10003054400 |
11 | 4273510909 |
12 | 1b32004768 |
13 | c35519801 |
14 | 6ac719dba |
15 | 3d82b2e85 |
hex | 2543a7f40 |
10003054400 has 42 divisors (see below), whose sum is σ = 24613769670. Its totient is φ = 4001221120.
The previous prime is 10003054387. The next prime is 10003054409. The reversal of 10003054400 is 445030001.
It can be written as a sum of positive squares in 3 ways, for example, as 3110069824 + 6892984576 = 55768^2 + 83024^2 .
It is a super-2 number, since 2×100030544002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10003054409) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3124355 + ... + 3127554.
It is an arithmetic number, because the mean of its divisors is an integer number (586042135).
Almost surely, 210003054400 is an apocalyptic number.
10003054400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10003054400 is an abundant number, since it is smaller than the sum of its proper divisors (14610715270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10003054400 is an equidigital number, since it uses as much as digits as its factorization.
10003054400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6251931 (or 6251916 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 17.
Adding to 10003054400 its reverse (445030001), we get a palindrome (10448084401).
The spelling of 10003054400 in words is "ten billion, three million, fifty-four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •