Base | Representation |
---|---|
bin | 1011111100010100110010… |
… | …0101110101101000111001 |
3 | 1201111022101222010121112122 |
4 | 2333011030211311220321 |
5 | 3210114242000330241 |
6 | 43532144221251025 |
7 | 2523453264334553 |
oct | 277051445655071 |
9 | 51438358117478 |
10 | 13131000011321 |
11 | 420290a200165 |
12 | 1580a61403a75 |
13 | 74332baa230a |
14 | 3357882424d3 |
15 | 17b87a1d004b |
hex | bf14c975a39 |
13131000011321 has 16 divisors (see below), whose sum is σ = 13173858714240. Its totient is φ = 13088209380480.
The previous prime is 13131000011317. The next prime is 13131000011329. The reversal of 13131000011321 is 12311000013131.
It is a cyclic number.
It is not a de Polignac number, because 13131000011321 - 22 = 13131000011317 is a prime.
It is a super-2 number, since 2×131310000113212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13131000011321.
It is not an unprimeable number, because it can be changed into a prime (13131000011329) 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, 2905729100 + ... + 2905733618.
It is an arithmetic number, because the mean of its divisors is an integer number (823366169640).
Almost surely, 213131000011321 is an apocalyptic number.
It is an amenable number.
13131000011321 is a deficient number, since it is larger than the sum of its proper divisors (42858702919).
13131000011321 is a wasteful number, since it uses less digits than its factorization.
13131000011321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10096.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 13131000011321 its reverse (12311000013131), we get a palindrome (25442000024452).
The spelling of 13131000011321 in words is "thirteen trillion, one hundred thirty-one billion, eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •