Base | Representation |
---|---|
bin | 10001110000100111011… |
… | …110100100000000101111 |
3 | 11022200011002001212000001 |
4 | 101300213132210000233 |
5 | 124443421324112221 |
6 | 2332354215245131 |
7 | 154113316431400 |
oct | 21604736440057 |
9 | 4280132055001 |
10 | 1220433035311 |
11 | 4306456a4a36 |
12 | 1786406797a7 |
13 | 8b1178cc649 |
14 | 430d81339a7 |
15 | 21b2d993391 |
hex | 11c277a402f |
1220433035311 has 24 divisors (see below), whose sum is σ = 1422119655936. Its totient is φ = 1044294879600.
The previous prime is 1220433035303. The next prime is 1220433035317. The reversal of 1220433035311 is 1135303340221.
It is not a de Polignac number, because 1220433035311 - 23 = 1220433035303 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1220433035311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220433035317) 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 23 ways as a sum of consecutive naturals, for example, 73480770 + ... + 73497376.
It is an arithmetic number, because the mean of its divisors is an integer number (59254985664).
Almost surely, 21220433035311 is an apocalyptic number.
1220433035311 is a deficient number, since it is larger than the sum of its proper divisors (201686620625).
1220433035311 is a wasteful number, since it uses less digits than its factorization.
1220433035311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19099 (or 19092 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 1220433035311 its reverse (1135303340221), we get a palindrome (2355736375532).
The spelling of 1220433035311 in words is "one trillion, two hundred twenty billion, four hundred thirty-three million, thirty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •