Base | Representation |
---|---|
bin | 10111011111010000101000… |
… | …011000110111100011011001 |
3 | 111112202200200210020012101020 |
4 | 113133100220120313203121 |
5 | 102020010004114323113 |
6 | 1003412503231113053 |
7 | 30521261236361154 |
oct | 2737205030674331 |
9 | 445680623205336 |
10 | 103303231011033 |
11 | 2aa087218835a9 |
12 | b704a37072789 |
13 | 45845b6cb04a1 |
14 | 1b71c8ddc8c9b |
15 | be224a199023 |
hex | 5df4286378d9 |
103303231011033 has 8 divisors (see below), whose sum is σ = 137737758288096. Its totient is φ = 68868762204000.
The previous prime is 103303231010953. The next prime is 103303231011047. The reversal of 103303231011033 is 330110132303301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103303231011033 - 237 = 103165792057561 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103303231010994 and 103303231011012.
It is not an unprimeable number, because it can be changed into a prime (103373231011033) 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, 10314043 + ... + 17691408.
It is an arithmetic number, because the mean of its divisors is an integer number (17217219786012).
Almost surely, 2103303231011033 is an apocalyptic number.
It is an amenable number.
103303231011033 is a deficient number, since it is larger than the sum of its proper divisors (34434527277063).
103303231011033 is a wasteful number, since it uses less digits than its factorization.
103303231011033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29235015.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 103303231011033 its reverse (330110132303301), we get a palindrome (433413363314334).
The spelling of 103303231011033 in words is "one hundred three trillion, three hundred three billion, two hundred thirty-one million, eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •