Base | Representation |
---|---|
bin | 11101111000011101010100… |
… | …111111100010000011011001 |
3 | 122020022221001220121120011221 |
4 | 131320131110333202003121 |
5 | 114211214032314343001 |
6 | 1143302541425452041 |
7 | 36453002453113360 |
oct | 3570352477420331 |
9 | 566287056546157 |
10 | 131423130231001 |
11 | 3896a266904404 |
12 | 128a68244a1021 |
13 | 58441c0217b7b |
14 | 2464cb06b67d7 |
15 | 102d93d1901a1 |
hex | 778754fe20d9 |
131423130231001 has 4 divisors (see below), whose sum is σ = 150197863121152. Its totient is φ = 112648397340852.
The previous prime is 131423130230957. The next prime is 131423130231059. The reversal of 131423130231001 is 100132031324131.
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 131423130231001 - 221 = 131423128133849 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131423130231101) 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, 9387366445065 + ... + 9387366445078.
It is an arithmetic number, because the mean of its divisors is an integer number (37549465780288).
Almost surely, 2131423130231001 is an apocalyptic number.
It is an amenable number.
131423130231001 is a deficient number, since it is larger than the sum of its proper divisors (18774732890151).
131423130231001 is an equidigital number, since it uses as much as digits as its factorization.
131423130231001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18774732890150.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 131423130231001 its reverse (100132031324131), we get a palindrome (231555161555132).
The spelling of 131423130231001 in words is "one hundred thirty-one trillion, four hundred twenty-three billion, one hundred thirty million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •