Base | Representation |
---|---|
bin | 10001110011010011001… |
… | …001100001011111011001 |
3 | 11022221120210121102201112 |
4 | 101303103021201133121 |
5 | 130020321134413423 |
6 | 2333552103230105 |
7 | 154244561433263 |
oct | 21632311413731 |
9 | 4287523542645 |
10 | 1223313201113 |
11 | 431893457153 |
12 | 179105148335 |
13 | 8b486517573 |
14 | 432cc864b33 |
15 | 21c4b765a78 |
hex | 11cd32617d9 |
1223313201113 has 8 divisors (see below), whose sum is σ = 1256394741000. Its totient is φ = 1190232662400.
The previous prime is 1223313201107. The next prime is 1223313201151. The reversal of 1223313201113 is 3111023133221.
It can be written as a sum of positive squares in 4 ways, for example, as 111884898064 + 1111428303049 = 334492^2 + 1054243^2 .
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 1223313201113 - 212 = 1223313197017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1223313201413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2686013 + ... + 3108261.
It is an arithmetic number, because the mean of its divisors is an integer number (157049342625).
Almost surely, 21223313201113 is an apocalyptic number.
It is an amenable number.
1223313201113 is a deficient number, since it is larger than the sum of its proper divisors (33081539887).
1223313201113 is an equidigital number, since it uses as much as digits as its factorization.
1223313201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500587.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1223313201113 its reverse (3111023133221), we get a palindrome (4334336334334).
The spelling of 1223313201113 in words is "one trillion, two hundred twenty-three billion, three hundred thirteen million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •