Base | Representation |
---|---|
bin | 1011110101111111000110… |
… | …1101000111111011101001 |
3 | 1201002220022121110021102221 |
4 | 2331133301231013323221 |
5 | 3201323230324342301 |
6 | 43410134241554041 |
7 | 2512546542166321 |
oct | 275376155077351 |
9 | 51086277407387 |
10 | 13022101012201 |
11 | 4170707599336 |
12 | 156392b345921 |
13 | 735c95716828 |
14 | 3303b737c281 |
15 | 178b04ab9da1 |
hex | bd7f1b47ee9 |
13022101012201 has 16 divisors (see below), whose sum is σ = 13517214916608. Its totient is φ = 12537711378000.
The previous prime is 13022101012183. The next prime is 13022101012213. The reversal of 13022101012201 is 10221010122031.
It is a cyclic number.
It is not a de Polignac number, because 13022101012201 - 211 = 13022101010153 is a prime.
It is a super-2 number, since 2×130221010122012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13022101012601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8176165 + ... + 9638146.
It is an arithmetic number, because the mean of its divisors is an integer number (844825932288).
Almost surely, 213022101012201 is an apocalyptic number.
It is an amenable number.
13022101012201 is a deficient number, since it is larger than the sum of its proper divisors (495113904407).
13022101012201 is a wasteful number, since it uses less digits than its factorization.
13022101012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17814612.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 13022101012201 its reverse (10221010122031), we get a palindrome (23243111134232).
The spelling of 13022101012201 in words is "thirteen trillion, twenty-two billion, one hundred one million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •