Base | Representation |
---|---|
bin | 11101110000000010001… |
… | …00111111000000010111 |
3 | 10121201112021211122011122 |
4 | 32320001010333000113 |
5 | 113222001344102221 |
6 | 2101333532354155 |
7 | 133565400121460 |
oct | 16700104770027 |
9 | 3551467748148 |
10 | 1022220300311 |
11 | 36458078a451 |
12 | 14614361595b |
13 | 75519961b32 |
14 | 37693571d67 |
15 | 1b8cc3adeab |
hex | ee0113f017 |
1022220300311 has 8 divisors (see below), whose sum is σ = 1169858726400. Its totient is φ = 874983612888.
The previous prime is 1022220300293. The next prime is 1022220300319. The reversal of 1022220300311 is 1130030222201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1022220300311 - 26 = 1022220300247 is a prime.
It is a super-2 number, since 2×10222203003112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1022220300311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022220300319) 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, 100429211 + ... + 100439388.
It is an arithmetic number, because the mean of its divisors is an integer number (146232340800).
Almost surely, 21022220300311 is an apocalyptic number.
1022220300311 is a deficient number, since it is larger than the sum of its proper divisors (147638426089).
1022220300311 is an equidigital number, since it uses as much as digits as its factorization.
1022220300311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200869333.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1022220300311 its reverse (1130030222201), we get a palindrome (2152250522512).
The spelling of 1022220300311 in words is "one trillion, twenty-two billion, two hundred twenty million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •