Base | Representation |
---|---|
bin | 1011000110111001101110… |
… | …0000110110100111010001 |
3 | 1121020120101222120022122012 |
4 | 2301232123200312213101 |
5 | 3100100113440301223 |
6 | 41550400033352305 |
7 | 2400242336335130 |
oct | 261563340664721 |
9 | 47216358508565 |
10 | 12213201103313 |
11 | 3989653697341 |
12 | 1453000408695 |
13 | 6a7913962ca2 |
14 | 30319d017917 |
15 | 162a602bcc78 |
hex | b1b9b8369d1 |
12213201103313 has 8 divisors (see below), whose sum is σ = 13983744388800. Its totient is φ = 10449107885520.
The previous prime is 12213201103303. The next prime is 12213201103399. The reversal of 12213201103313 is 31330110231221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12213201103313 - 224 = 12213184326097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12213201103303) 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 7 ways as a sum of consecutive naturals, for example, 1612512863 + ... + 1612520436.
It is an arithmetic number, because the mean of its divisors is an integer number (1747968048600).
Almost surely, 212213201103313 is an apocalyptic number.
It is an amenable number.
12213201103313 is a deficient number, since it is larger than the sum of its proper divisors (1770543285487).
12213201103313 is an equidigital number, since it uses as much as digits as its factorization.
12213201103313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3225033847.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12213201103313 its reverse (31330110231221), we get a palindrome (43543311334534).
The spelling of 12213201103313 in words is "twelve trillion, two hundred thirteen billion, two hundred one million, one hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •