Base | Representation |
---|---|
bin | 10001110011001000010… |
… | …011010100100101010111 |
3 | 11022221010010011211222211 |
4 | 101303020103110211113 |
5 | 130014433043022221 |
6 | 2333522042534251 |
7 | 154240221555100 |
oct | 21631023244527 |
9 | 4287103154884 |
10 | 1223131220311 |
11 | 4317aa7612a0 |
12 | 179074207387 |
13 | 8b4578cbc10 |
14 | 432b26133a7 |
15 | 21c3a7ba6e1 |
hex | 11cc84d4957 |
1223131220311 has 48 divisors (see below), whose sum is σ = 1680912051840. Its totient is φ = 874858864320.
The previous prime is 1223131220303. The next prime is 1223131220323. The reversal of 1223131220311 is 1130221313221.
It is not a de Polignac number, because 1223131220311 - 23 = 1223131220303 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1223131220351) 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 47 ways as a sum of consecutive naturals, for example, 766660 + ... + 1741846.
It is an arithmetic number, because the mean of its divisors is an integer number (35019001080).
Almost surely, 21223131220311 is an apocalyptic number.
1223131220311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1223131220311 is a deficient number, since it is larger than the sum of its proper divisors (457780831529).
1223131220311 is a wasteful number, since it uses less digits than its factorization.
1223131220311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 975404 (or 975397 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1223131220311 its reverse (1130221313221), we get a palindrome (2353352533532).
The spelling of 1223131220311 in words is "one trillion, two hundred twenty-three billion, one hundred thirty-one million, two hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •