Base | Representation |
---|---|
bin | 110000000100100000… |
… | …0011000101110000100 |
3 | 100212110022001011021222 |
4 | 1200021000120232010 |
5 | 3142403424430200 |
6 | 115231235455512 |
7 | 10313100111464 |
oct | 1401100305604 |
9 | 325408034258 |
10 | 103230311300 |
11 | 3a863901866 |
12 | 1800b757598 |
13 | 9971b31b4c |
14 | 4dd4099ba4 |
15 | 2a42b23d85 |
hex | 1809018b84 |
103230311300 has 36 divisors (see below), whose sum is σ = 224023721460. Its totient is φ = 41289553920.
The previous prime is 103230311299. The next prime is 103230311329. The reversal of 103230311300 is 3113032301.
103230311300 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 425431876 + 102804879424 = 20626^2 + 320632^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3149396 + ... + 3182004.
Almost surely, 2103230311300 is an apocalyptic number.
103230311300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103230311300 is an abundant number, since it is smaller than the sum of its proper divisors (120793410160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103230311300 is a wasteful number, since it uses less digits than its factorization.
103230311300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64280 (or 64273 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 103230311300 its reverse (3113032301), we get a palindrome (106343343601).
The spelling of 103230311300 in words is "one hundred three billion, two hundred thirty million, three hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •