Base | Representation |
---|---|
bin | 1011110101010110111010… |
… | …1101011000101110110011 |
3 | 1201001212110210112022000022 |
4 | 2331111232231120232303 |
5 | 3201134132203043443 |
6 | 43401152000314055 |
7 | 2512015321336142 |
oct | 275255655305663 |
9 | 51055423468008 |
10 | 13011313331123 |
11 | 4167081197928 |
12 | 156181a61292b |
13 | 734c6679a6a3 |
14 | 32da72779759 |
15 | 1786c29b9e68 |
hex | bd56eb58bb3 |
13011313331123 has 16 divisors (see below), whose sum is σ = 14002844358816. Its totient is φ = 12044920112640.
The previous prime is 13011313331119. The next prime is 13011313331147. The reversal of 13011313331123 is 32113331311031.
It is a cyclic number.
It is not a de Polignac number, because 13011313331123 - 22 = 13011313331119 is a prime.
It is a super-2 number, since 2×130113133311232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13011313331092 and 13011313331101.
It is not an unprimeable number, because it can be changed into a prime (13011313336123) 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, 58015040 + ... + 58238882.
It is an arithmetic number, because the mean of its divisors is an integer number (875177772426).
Almost surely, 213011313331123 is an apocalyptic number.
13011313331123 is a deficient number, since it is larger than the sum of its proper divisors (991531027693).
13011313331123 is a wasteful number, since it uses less digits than its factorization.
13011313331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279974.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 13011313331123 its reverse (32113331311031), we get a palindrome (45124644642154).
The spelling of 13011313331123 in words is "thirteen trillion, eleven billion, three hundred thirteen million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •