Base | Representation |
---|---|
bin | 101111111101101101… |
… | …0100110101010011010 |
3 | 100211212102000010212221 |
4 | 1133323122212222122 |
5 | 3141422042200010 |
6 | 115152452454254 |
7 | 10304331062566 |
oct | 1377332465232 |
9 | 324772003787 |
10 | 103002303130 |
11 | 3a757129961 |
12 | 17b6731a38a |
13 | 993681c37c |
14 | 4db1aa66a6 |
15 | 2a2cad5dda |
hex | 17fb6a6a9a |
103002303130 has 8 divisors (see below), whose sum is σ = 185404145652. Its totient is φ = 41200921248.
The previous prime is 103002303091. The next prime is 103002303133. The reversal of 103002303130 is 31303200301.
103002303130 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 2 ways, for example, as 100753551889 + 2248751241 = 317417^2 + 47421^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (103002303133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5150115147 + ... + 5150115166.
Almost surely, 2103002303130 is an apocalyptic number.
103002303130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103002303130 is a deficient number, since it is larger than the sum of its proper divisors (82401842522).
103002303130 is a wasteful number, since it uses less digits than its factorization.
103002303130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10300230320.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 103002303130 its reverse (31303200301), we get a palindrome (134305503431).
The spelling of 103002303130 in words is "one hundred three billion, two million, three hundred three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •