Base | Representation |
---|---|
bin | 10111011111010000011010… |
… | …110100010000101110111001 |
3 | 111112202200002220202211200220 |
4 | 113133100122310100232321 |
5 | 102020004022321423113 |
6 | 1003412424454450253 |
7 | 30521252503064601 |
oct | 2737203264205671 |
9 | 445680086684626 |
10 | 103303003311033 |
11 | 2aa086152a1189 |
12 | b704992963989 |
13 | 458457ba78066 |
14 | 1b71c6ba75c01 |
15 | be22351bc523 |
hex | 5df41ad10bb9 |
103303003311033 has 8 divisors (see below), whose sum is σ = 138224042122848. Its totient is φ = 68625316686624.
The previous prime is 103303003311023. The next prime is 103303003311169. The reversal of 103303003311033 is 330113300303301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103303003311033 - 28 = 103303003310777 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103303003310994 and 103303003311012.
It is not an unprimeable number, because it can be changed into a prime (103303003311023) 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, 60838045860 + ... + 60838047557.
It is an arithmetic number, because the mean of its divisors is an integer number (17278005265356).
Almost surely, 2103303003311033 is an apocalyptic number.
It is an amenable number.
103303003311033 is a deficient number, since it is larger than the sum of its proper divisors (34921038811815).
103303003311033 is a wasteful number, since it uses less digits than its factorization.
103303003311033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121676093703.
The product of its (nonzero) digits is 2187, while the sum is 24.
Adding to 103303003311033 its reverse (330113300303301), we get a palindrome (433416303614334).
The spelling of 103303003311033 in words is "one hundred three trillion, three hundred three billion, three million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •