Base | Representation |
---|---|
bin | 11101110101010001010001… |
… | …101110001010001110010001 |
3 | 122012112222112120122220001112 |
4 | 131311101101232022032101 |
5 | 114144121324143410301 |
6 | 1143014144502343105 |
7 | 36431115140023160 |
oct | 3565212156121621 |
9 | 565488476586045 |
10 | 131204032013201 |
11 | 38895354653534 |
12 | 12870278a2aa95 |
13 | 58296442bca04 |
14 | 2458447db13d7 |
15 | 1027db822e9bb |
hex | 775451b8a391 |
131204032013201 has 8 divisors (see below), whose sum is σ = 149957695708800. Its totient is φ = 112452925955328.
The previous prime is 131204032013191. The next prime is 131204032013203. The reversal of 131204032013201 is 102310230402131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131204032013201 - 210 = 131204032012177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131204032013203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 639299501 + ... + 639504698.
It is an arithmetic number, because the mean of its divisors is an integer number (18744711963600).
Almost surely, 2131204032013201 is an apocalyptic number.
It is an amenable number.
131204032013201 is a deficient number, since it is larger than the sum of its proper divisors (18753663695599).
131204032013201 is a wasteful number, since it uses less digits than its factorization.
131204032013201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1278818863.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 131204032013201 its reverse (102310230402131), we get a palindrome (233514262415332).
The spelling of 131204032013201 in words is "one hundred thirty-one trillion, two hundred four billion, thirty-two million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •