Base | Representation |
---|---|
bin | 11101111110111010000… |
… | …00010000010010100000 |
3 | 10122111010202111011211201 |
4 | 32333131000100102200 |
5 | 113334324440441300 |
6 | 2105134124450544 |
7 | 134300304100564 |
oct | 16773500202240 |
9 | 3574122434751 |
10 | 1030205015200 |
11 | 3679a8967979 |
12 | 1477b16a9a54 |
13 | 761bcc828ba |
14 | 37c0dbbb6a4 |
15 | 1bbe838a66a |
hex | efdd0104a0 |
1030205015200 has 72 divisors (see below), whose sum is σ = 2624335344288. Its totient is φ = 394165390080.
The previous prime is 1030205015197. The next prime is 1030205015207. The reversal of 1030205015200 is 25105020301.
It is a super-2 number, since 2×10302050152002 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1030205015207) 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 11 ways as a sum of consecutive naturals, for example, 27976302 + ... + 28013101.
It is an arithmetic number, because the mean of its divisors is an integer number (36449102004).
Almost surely, 21030205015200 is an apocalyptic number.
1030205015200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1030205015200 is an abundant number, since it is smaller than the sum of its proper divisors (1594130329088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030205015200 is a wasteful number, since it uses less digits than its factorization.
1030205015200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55989446 (or 55989433 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 19.
The spelling of 1030205015200 in words is "one trillion, thirty billion, two hundred five million, fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •