Base | Representation |
---|---|
bin | 10001110011010010011… |
… | …011011001100111000101 |
3 | 11022221112221212011010102 |
4 | 101303102123121213011 |
5 | 130020310041011323 |
6 | 2333550552133445 |
7 | 154244353604660 |
oct | 21632233314705 |
9 | 4287487764112 |
10 | 1223301110213 |
11 | 431887649076 |
12 | 179101097285 |
13 | 8b483b730a0 |
14 | 432cadd86d7 |
15 | 21c4a678328 |
hex | 11cd26d99c5 |
1223301110213 has 8 divisors (see below), whose sum is σ = 1505601366528. Its totient is φ = 967886592624.
The previous prime is 1223301110209. The next prime is 1223301110249. The reversal of 1223301110213 is 3120111033221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1223301110213 - 22 = 1223301110209 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1223301110293) 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, 6721434581 + ... + 6721434762.
It is an arithmetic number, because the mean of its divisors is an integer number (188200170816).
Almost surely, 21223301110213 is an apocalyptic number.
1223301110213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1223301110213 is a deficient number, since it is larger than the sum of its proper divisors (282300256315).
1223301110213 is a wasteful number, since it uses less digits than its factorization.
1223301110213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13442869363.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1223301110213 its reverse (3120111033221), we get a palindrome (4343412143434).
The spelling of 1223301110213 in words is "one trillion, two hundred twenty-three billion, three hundred one million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •