Base | Representation |
---|---|
bin | 1100000010001011001011… |
… | …0111101000110010101011 |
3 | 1201211220210222222020012212 |
4 | 3000202302313220302223 |
5 | 3213241103022414011 |
6 | 44050244533155335 |
7 | 2533641624010442 |
oct | 300426267506253 |
9 | 51756728866185 |
10 | 13231500201131 |
11 | 42414a1a12273 |
12 | 159842a78bb4b |
13 | 74c957102354 |
14 | 33a59d8a7d59 |
15 | 17e2ad2be08b |
hex | c08b2de8cab |
13231500201131 has 16 divisors (see below), whose sum is σ = 14119072581600. Its totient is φ = 12356173997568.
The previous prime is 13231500201083. The next prime is 13231500201163. The reversal of 13231500201131 is 13110200513231.
It is a de Polignac number, because none of the positive numbers 2k-13231500201131 is a prime.
It is a super-2 number, since 2×132315002011312 (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 = 13231500201097 and 13231500201106.
It is not an unprimeable number, because it can be changed into a prime (13231500201181) 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, 2266361 + ... + 5621333.
It is an arithmetic number, because the mean of its divisors is an integer number (882442036350).
Almost surely, 213231500201131 is an apocalyptic number.
13231500201131 is a deficient number, since it is larger than the sum of its proper divisors (887572380469).
13231500201131 is a wasteful number, since it uses less digits than its factorization.
13231500201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3356798.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 13231500201131 its reverse (13110200513231), we get a palindrome (26341700714362).
The spelling of 13231500201131 in words is "thirteen trillion, two hundred thirty-one billion, five hundred million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •