Base | Representation |
---|---|
bin | 10111011010111111110101… |
… | …100101111101101101110011 |
3 | 111111201200122101102110020022 |
4 | 113122333311211331231303 |
5 | 102000210114140430003 |
6 | 1003030142125434055 |
7 | 30461151532536662 |
oct | 2732776545755563 |
9 | 444650571373208 |
10 | 103010321030003 |
11 | 2a905482825512 |
12 | b67811010b92b |
13 | 4562aa701529a |
14 | 1b61a24756dd9 |
15 | bd9805186738 |
hex | 5daff597db73 |
103010321030003 has 8 divisors (see below), whose sum is σ = 106348607571840. Its totient is φ = 99672995298240.
The previous prime is 103010321029969. The next prime is 103010321030033. The reversal of 103010321030003 is 300030123010301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103010321030003 is a prime.
It is a super-2 number, since 2×1030103210300032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103010321030033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 239984618 + ... + 240413471.
It is an arithmetic number, because the mean of its divisors is an integer number (13293575946480).
Almost surely, 2103010321030003 is an apocalyptic number.
103010321030003 is a deficient number, since it is larger than the sum of its proper divisors (3338286541837).
103010321030003 is an equidigital number, since it uses as much as digits as its factorization.
103010321030003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 480405037.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 103010321030003 its reverse (300030123010301), we get a palindrome (403040444040304).
The spelling of 103010321030003 in words is "one hundred three trillion, ten billion, three hundred twenty-one million, thirty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •