Base | Representation |
---|---|
bin | 10111011111100010011010… |
… | …110101101000011010100011 |
3 | 111112211111222220021100011021 |
4 | 113133202122311220122203 |
5 | 102020313113220214021 |
6 | 1003425342410430311 |
7 | 30522535452656242 |
oct | 2737423265503243 |
9 | 445744886240137 |
10 | 103322331023011 |
11 | 2aa15833289271 |
12 | b708687732397 |
13 | 458633c097019 |
14 | 1b72b82958959 |
15 | be29b6ddbc41 |
hex | 5df89ad686a3 |
103322331023011 has 4 divisors (see below), whose sum is σ = 103322477629800. Its totient is φ = 103322184416224.
The previous prime is 103322331023003. The next prime is 103322331023029. The reversal of 103322331023011 is 110320133223301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103322331023011 - 23 = 103322331023003 is a prime.
It is a super-2 number, since 2×1033223310230112 (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 (103322331023071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72241126 + ... + 73657483.
It is an arithmetic number, because the mean of its divisors is an integer number (25830619407450).
Almost surely, 2103322331023011 is an apocalyptic number.
103322331023011 is a deficient number, since it is larger than the sum of its proper divisors (146606789).
103322331023011 is an equidigital number, since it uses as much as digits as its factorization.
103322331023011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146606788.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 103322331023011 its reverse (110320133223301), we get a palindrome (213642464246312).
The spelling of 103322331023011 in words is "one hundred three trillion, three hundred twenty-two billion, three hundred thirty-one million, twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •