Base | Representation |
---|---|
bin | 11101110000001100110… |
… | …11001101010110010111 |
3 | 10121201202112122110220022 |
4 | 32320012123031112113 |
5 | 113222142330343221 |
6 | 2101350455255355 |
7 | 133600536504500 |
oct | 16700633152627 |
9 | 3551675573808 |
10 | 1022310012311 |
11 | 3646173943a5 |
12 | 14616967a55b |
13 | 75532412963 |
14 | 376a1445ba7 |
15 | 1b8d51d04ab |
hex | ee066cd597 |
1022310012311 has 12 divisors (see below), whose sum is σ = 1189243481040. Its totient is φ = 876246779520.
The previous prime is 1022310012289. The next prime is 1022310012389. The reversal of 1022310012311 is 1132100132201.
It is a de Polignac number, because none of the positive numbers 2k-1022310012311 is a prime.
It is a super-2 number, since 2×10223100123112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1022310012311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022310012211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2364350 + ... + 2763108.
It is an arithmetic number, because the mean of its divisors is an integer number (99103623420).
Almost surely, 21022310012311 is an apocalyptic number.
1022310012311 is a deficient number, since it is larger than the sum of its proper divisors (166933468729).
1022310012311 is an equidigital number, since it uses as much as digits as its factorization.
1022310012311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451094 (or 451087 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1022310012311 its reverse (1132100132201), we get a palindrome (2154410144512).
The spelling of 1022310012311 in words is "one trillion, twenty-two billion, three hundred ten million, twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •