Base | Representation |
---|---|
bin | 1011111010100110001100… |
… | …0011100100000000111101 |
3 | 1201101110202222011001001120 |
4 | 2332221203003210000331 |
5 | 3204122441401144013 |
6 | 43510354255101153 |
7 | 2521352504454162 |
oct | 276514303440075 |
9 | 51343688131046 |
10 | 13101312131133 |
11 | 41a1265169396 |
12 | 1577156b117b9 |
13 | 7405aa28c6c5 |
14 | 33416d444069 |
15 | 17abddbab123 |
hex | bea630e403d |
13101312131133 has 32 divisors (see below), whose sum is σ = 18734312779776. Its totient is φ = 8124624201408.
The previous prime is 13101312131107. The next prime is 13101312131137. The reversal of 13101312131133 is 33113121310131.
It is not a de Polignac number, because 13101312131133 - 212 = 13101312127037 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13101312131137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12356691 + ... + 13374992.
It is an arithmetic number, because the mean of its divisors is an integer number (585447274368).
Almost surely, 213101312131133 is an apocalyptic number.
It is an amenable number.
13101312131133 is a deficient number, since it is larger than the sum of its proper divisors (5633000648643).
13101312131133 is a wasteful number, since it uses less digits than its factorization.
13101312131133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25731913.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 13101312131133 its reverse (33113121310131), we get a palindrome (46214433441264).
The spelling of 13101312131133 in words is "thirteen trillion, one hundred one billion, three hundred twelve million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •