Base | Representation |
---|---|
bin | 1010001101101011011101… |
… | …1000010011010110101011 |
3 | 1110202120220110010102222201 |
4 | 2203122313120103112223 |
5 | 2432443242001104003 |
6 | 35515014005401031 |
7 | 2236230604314322 |
oct | 243326730232653 |
9 | 43676813112881 |
10 | 11230121113003 |
11 | 363a738666131 |
12 | 1314580a09177 |
13 | 635cc3c31a00 |
14 | 2ab77dbcb0b9 |
15 | 1471c41ccb1d |
hex | a36b76135ab |
11230121113003 has 12 divisors (see below), whose sum is σ = 12212617720680. Its totient is φ = 10321775196096.
The previous prime is 11230121112943. The next prime is 11230121113091. The reversal of 11230121113003 is 30031112103211.
It is not a de Polignac number, because 11230121113003 - 233 = 11221531178411 is a prime.
It is a super-2 number, since 2×112301211130032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11230121113103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 142558093 + ... + 142636846.
It is an arithmetic number, because the mean of its divisors is an integer number (1017718143390).
Almost surely, 211230121113003 is an apocalyptic number.
11230121113003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11230121113003 is a deficient number, since it is larger than the sum of its proper divisors (982496607677).
11230121113003 is a wasteful number, since it uses less digits than its factorization.
11230121113003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285195198 (or 285195185 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11230121113003 its reverse (30031112103211), we get a palindrome (41261233216214).
The spelling of 11230121113003 in words is "eleven trillion, two hundred thirty billion, one hundred twenty-one million, one hundred thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •