Base | Representation |
---|---|
bin | 10111011011001001111000… |
… | …110011100001001011010011 |
3 | 111111202201111110011110000111 |
4 | 113123021320303201023103 |
5 | 102000344214224124021 |
6 | 1003035125020502151 |
7 | 30462013126233535 |
oct | 2733117063411323 |
9 | 444681443143014 |
10 | 103021112333011 |
11 | 2a90a010180154 |
12 | b67a2220aa957 |
13 | 4563b0692bb92 |
14 | 1b62369a1d855 |
15 | bd9c3774e8e1 |
hex | 5db278ce12d3 |
103021112333011 has 4 divisors (see below), whose sum is σ = 103021349667192. Its totient is φ = 103020874998832.
The previous prime is 103021112332993. The next prime is 103021112333033. The reversal of 103021112333011 is 110333211120301.
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 103021112333011 - 245 = 67836740244179 is a prime.
It is a super-2 number, since 2×1030211123330112 (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 (103021112333311) 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, 118014781 + ... + 118884526.
It is an arithmetic number, because the mean of its divisors is an integer number (25755337416798).
Almost surely, 2103021112333011 is an apocalyptic number.
103021112333011 is a deficient number, since it is larger than the sum of its proper divisors (237334181).
103021112333011 is an equidigital number, since it uses as much as digits as its factorization.
103021112333011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237334180.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 103021112333011 its reverse (110333211120301), we get a palindrome (213354323453312).
The spelling of 103021112333011 in words is "one hundred three trillion, twenty-one billion, one hundred twelve million, three hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •