Base | Representation |
---|---|
bin | 11101110010110000001001… |
… | …100110101110011111010001 |
3 | 122011221102222022110101121121 |
4 | 131302300021212232133101 |
5 | 114133303013443210301 |
6 | 1142402453211522241 |
7 | 36412451624133352 |
oct | 3562601146563721 |
9 | 564842868411547 |
10 | 131031023413201 |
11 | 38828a4382168a |
12 | 12842834759381 |
13 | 5816231c5cb52 |
14 | 244dd14933d29 |
15 | 102363e6e23a1 |
hex | 772c099ae7d1 |
131031023413201 has 4 divisors (see below), whose sum is σ = 131031048513904. Its totient is φ = 131030998312500.
The previous prime is 131031023413097. The next prime is 131031023413247. The reversal of 131031023413201 is 102314320130131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131031023413201 - 211 = 131031023411153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131031026413201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1443675 + ... + 16252576.
It is an arithmetic number, because the mean of its divisors is an integer number (32757762128476).
Almost surely, 2131031023413201 is an apocalyptic number.
It is an amenable number.
131031023413201 is a deficient number, since it is larger than the sum of its proper divisors (25100703).
131031023413201 is an equidigital number, since it uses as much as digits as its factorization.
131031023413201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25100702.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 131031023413201 its reverse (102314320130131), we get a palindrome (233345343543332).
The spelling of 131031023413201 in words is "one hundred thirty-one trillion, thirty-one billion, twenty-three million, four hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •