Base | Representation |
---|---|
bin | 10011001101010110110… |
… | …110101000010010010001 |
3 | 11200012011220200112200110 |
4 | 103031112312220102101 |
5 | 133111341100334413 |
6 | 2450223304511533 |
7 | 164240062621221 |
oct | 23152666502221 |
9 | 4605156615613 |
10 | 1320012121233 |
11 | 4698a5480063 |
12 | 1939b147b5a9 |
13 | 976271572b0 |
14 | 47c63308081 |
15 | 2450ac878c3 |
hex | 13356da8491 |
1320012121233 has 16 divisors (see below), whose sum is σ = 1906751742336. Its totient is φ = 807450984960.
The previous prime is 1320012121147. The next prime is 1320012121327. The reversal of 1320012121233 is 3321212100231.
It is not a de Polignac number, because 1320012121233 - 229 = 1319475250321 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1320012123233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101330208 + ... + 101343233.
It is an arithmetic number, because the mean of its divisors is an integer number (119171983896).
Almost surely, 21320012121233 is an apocalyptic number.
1320012121233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1320012121233 is a deficient number, since it is larger than the sum of its proper divisors (586739621103).
1320012121233 is a wasteful number, since it uses less digits than its factorization.
1320012121233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202673624.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1320012121233 its reverse (3321212100231), we get a palindrome (4641224221464).
The spelling of 1320012121233 in words is "one trillion, three hundred twenty billion, twelve million, one hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •