Base | Representation |
---|---|
bin | 1001001101110101100010… |
… | …0001110110101101011001 |
3 | 1022212201212000101111012120 |
4 | 2103131120201312231121 |
5 | 2312011011124333423 |
6 | 33315102455531453 |
7 | 2064051642233010 |
oct | 223353041665531 |
9 | 38781760344176 |
10 | 10133313121113 |
11 | 325757209a076 |
12 | 1177aa2089b89 |
13 | 58674b557740 |
14 | 27065262ba77 |
15 | 1288cda9bee3 |
hex | 93758876b59 |
10133313121113 has 32 divisors (see below), whose sum is σ = 17165446889472. Its totient is φ = 5172623496000.
The previous prime is 10133313121109. The next prime is 10133313121199. The reversal of 10133313121113 is 31112131333101.
It is not a de Polignac number, because 10133313121113 - 22 = 10133313121109 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10133313120113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 598674813 + ... + 598691738.
It is an arithmetic number, because the mean of its divisors is an integer number (536420215296).
Almost surely, 210133313121113 is an apocalyptic number.
10133313121113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10133313121113 is a deficient number, since it is larger than the sum of its proper divisors (7032133768359).
10133313121113 is a wasteful number, since it uses less digits than its factorization.
10133313121113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1197366605.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 10133313121113 its reverse (31112131333101), we get a palindrome (41245444454214).
The spelling of 10133313121113 in words is "ten trillion, one hundred thirty-three billion, three hundred thirteen million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •