Base | Representation |
---|---|
bin | 10111011010111111110101… |
… | …001000100110100111010001 |
3 | 111111201200121211221102012120 |
4 | 113122333311020212213101 |
5 | 102000210110203130301 |
6 | 1003030141252444453 |
7 | 30461151410242221 |
oct | 2732776510464721 |
9 | 444650554842176 |
10 | 103010313333201 |
11 | 2a90547944881a |
12 | b678109619729 |
13 | 4562aa554bb71 |
14 | 1b61a23712081 |
15 | bd9804665e36 |
hex | 5daff52269d1 |
103010313333201 has 8 divisors (see below), whose sum is σ = 137394169503744. Its totient is φ = 68649999692400.
The previous prime is 103010313333163. The next prime is 103010313333209. The reversal of 103010313333201 is 102333313010301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103010313333201 - 222 = 103010309138897 is a prime.
It is a super-2 number, since 2×1030103133332012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103010313333209) 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, 5885622225 + ... + 5885639726.
It is an arithmetic number, because the mean of its divisors is an integer number (17174271187968).
Almost surely, 2103010313333201 is an apocalyptic number.
It is an amenable number.
103010313333201 is a deficient number, since it is larger than the sum of its proper divisors (34383856170543).
103010313333201 is a wasteful number, since it uses less digits than its factorization.
103010313333201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11771264871.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 103010313333201 its reverse (102333313010301), we get a palindrome (205343626343502).
The spelling of 103010313333201 in words is "one hundred three trillion, ten billion, three hundred thirteen million, three hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •