Base | Representation |
---|---|
bin | 1011110101111111000110… |
… | …1101001001111000110011 |
3 | 1201002220022121110200102121 |
4 | 2331133301231021320303 |
5 | 3201323230330121321 |
6 | 43410134242055111 |
7 | 2512546542231553 |
oct | 275376155117063 |
9 | 51086277420377 |
10 | 13022101020211 |
11 | 41707075a4358 |
12 | 156392b34a497 |
13 | 735c9571a37a |
14 | 3303b7381163 |
15 | 178b04abc441 |
hex | bd7f1b49e33 |
13022101020211 has 4 divisors (see below), whose sum is σ = 13022684809992. Its totient is φ = 13021517230432.
The previous prime is 13022101020199. The next prime is 13022101020217. The reversal of 13022101020211 is 11202010122031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13022101020211 - 237 = 12884662066739 is a prime.
It is a super-3 number, since 3×130221010202113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13022101020217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 291861430 + ... + 291906043.
It is an arithmetic number, because the mean of its divisors is an integer number (3255671202498).
Almost surely, 213022101020211 is an apocalyptic number.
13022101020211 is a deficient number, since it is larger than the sum of its proper divisors (583789781).
13022101020211 is an equidigital number, since it uses as much as digits as its factorization.
13022101020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 583789780.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 13022101020211 its reverse (11202010122031), we get a palindrome (24224111142242).
The spelling of 13022101020211 in words is "thirteen trillion, twenty-two billion, one hundred one million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •