Base | Representation |
---|---|
bin | 1011111011110100000000… |
… | …0101101001010011100101 |
3 | 1201110110200200221112001102 |
4 | 2332331000011221103211 |
5 | 3204443231234423023 |
6 | 43524131113205445 |
7 | 2523022233166613 |
oct | 276750005512345 |
9 | 51413620845042 |
10 | 13122200311013 |
11 | 41aa103a87072 |
12 | 157b206400885 |
13 | 742558982861 |
14 | 33519168a6b3 |
15 | 17b5128bb628 |
hex | bef401694e5 |
13122200311013 has 16 divisors (see below), whose sum is σ = 13714028697600. Its totient is φ = 12540166242240.
The previous prime is 13122200310979. The next prime is 13122200311039. The reversal of 13122200311013 is 31011300222131.
It is a happy number.
13122200311013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13122200311013 - 26 = 13122200310949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13122200311063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3054278 + ... + 5964311.
It is an arithmetic number, because the mean of its divisors is an integer number (857126793600).
Almost surely, 213122200311013 is an apocalyptic number.
It is an amenable number.
13122200311013 is a deficient number, since it is larger than the sum of its proper divisors (591828386587).
13122200311013 is a wasteful number, since it uses less digits than its factorization.
13122200311013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9019132.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13122200311013 its reverse (31011300222131), we get a palindrome (44133500533144).
The spelling of 13122200311013 in words is "thirteen trillion, one hundred twenty-two billion, two hundred million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •