Base | Representation |
---|---|
bin | 1011110101010110001010… |
… | …1010000001000011100010 |
3 | 1201001211221201000222001000 |
4 | 2331111202222001003202 |
5 | 3201133223421333442 |
6 | 43401115534252430 |
7 | 2512010314515462 |
oct | 275254252010342 |
9 | 51054851028030 |
10 | 13011111121122 |
11 | 4166a88035524 |
12 | 1561782957116 |
13 | 734c3391b4ba |
14 | 32da5397dba2 |
15 | 1786aed75d4c |
hex | bd562a810e2 |
13011111121122 has 32 divisors (see below), whose sum is σ = 28929634666560. Its totient is φ = 4334628880800.
The previous prime is 13011111121093. The next prime is 13011111121147. The reversal of 13011111121122 is 22112111111031.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 13011111121095 and 13011111121104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66795168 + ... + 66989675.
It is an arithmetic number, because the mean of its divisors is an integer number (904051083330).
Almost surely, 213011111121122 is an apocalyptic number.
13011111121122 is an abundant number, since it is smaller than the sum of its proper divisors (15918523545438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13011111121122 is a wasteful number, since it uses less digits than its factorization.
13011111121122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133786655 (or 133786649 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 18.
Adding to 13011111121122 its reverse (22112111111031), we get a palindrome (35123222232153).
The spelling of 13011111121122 in words is "thirteen trillion, eleven billion, one hundred eleven million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •