Base | Representation |
---|---|
bin | 11101111111010110010… |
… | …00110001101100011000 |
3 | 10122111202021122212110202 |
4 | 32333223020301230120 |
5 | 113340321141131300 |
6 | 2105213435001332 |
7 | 134306213406140 |
oct | 16775310615430 |
9 | 3574667585422 |
10 | 1030442130200 |
11 | 36800a79a98a |
12 | 147858b99248 |
13 | 7622a133532 |
14 | 37c334a1920 |
15 | 1bc0e0c6ad5 |
hex | efeb231b18 |
1030442130200 has 48 divisors (see below), whose sum is σ = 2738031949680. Its totient is φ = 353294444160.
The previous prime is 1030442130191. The next prime is 1030442130257. The reversal of 1030442130200 is 20312440301.
It is a super-2 number, since 2×10304421302002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 368013647 + ... + 368016446.
It is an arithmetic number, because the mean of its divisors is an integer number (57042332285).
Almost surely, 21030442130200 is an apocalyptic number.
1030442130200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1030442130200 is an abundant number, since it is smaller than the sum of its proper divisors (1707589819480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030442130200 is a wasteful number, since it uses less digits than its factorization.
1030442130200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 736030116 (or 736030107 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 1030442130200 its reverse (20312440301), we get a palindrome (1050754570501).
The spelling of 1030442130200 in words is "one trillion, thirty billion, four hundred forty-two million, one hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •