Base | Representation |
---|---|
bin | 10011010110111100110… |
… | …001100101110111010111 |
3 | 11201011202201202011112111 |
4 | 103112330301211313113 |
5 | 133243434333324343 |
6 | 2455045323131451 |
7 | 165053241344056 |
oct | 23267461456727 |
9 | 4634681664474 |
10 | 1330312011223 |
11 | 4732004a3938 |
12 | 1959a6973b87 |
13 | 985a9004460 |
14 | 4855d21239d |
15 | 24910131c9d |
hex | 135bcc65dd7 |
1330312011223 has 16 divisors (see below), whose sum is σ = 1517749422336. Its totient is φ = 1155111851520.
The previous prime is 1330312011221. The next prime is 1330312011227. The reversal of 1330312011223 is 3221102130331.
It is a cyclic number.
It is not a de Polignac number, because 1330312011223 - 21 = 1330312011221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330312011194 and 1330312011203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330312011221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1248108 + ... + 2053873.
It is an arithmetic number, because the mean of its divisors is an integer number (94859338896).
Almost surely, 21330312011223 is an apocalyptic number.
1330312011223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1330312011223 is a deficient number, since it is larger than the sum of its proper divisors (187437411113).
1330312011223 is a wasteful number, since it uses less digits than its factorization.
1330312011223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3303834.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1330312011223 its reverse (3221102130331), we get a palindrome (4551414141554).
The spelling of 1330312011223 in words is "one trillion, three hundred thirty billion, three hundred twelve million, eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •