Base | Representation |
---|---|
bin | 11101110101001110110110… |
… | …000010111101100000000101 |
3 | 122012112201210120010001220121 |
4 | 131311032312002331200011 |
5 | 114144101002034023141 |
6 | 1143013033402501541 |
7 | 36430663334115025 |
oct | 3565166602754005 |
9 | 565481716101817 |
10 | 131201420220421 |
11 | 38894234333a01 |
12 | 1286b86a2048b1 |
13 | 582931917b1b5 |
14 | 245827b17da85 |
15 | 1027cb3cc01d1 |
hex | 7753b60bd805 |
131201420220421 has 8 divisors (see below), whose sum is σ = 131701401025920. Its totient is φ = 130701447870672.
The previous prime is 131201420220373. The next prime is 131201420220457. The reversal of 131201420220421 is 124022024102131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131201420220421 - 213 = 131201420212229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131201420620421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29899600 + ... + 34005718.
It is an arithmetic number, because the mean of its divisors is an integer number (16462675128240).
Almost surely, 2131201420220421 is an apocalyptic number.
It is an amenable number.
131201420220421 is a deficient number, since it is larger than the sum of its proper divisors (499980805499).
131201420220421 is a wasteful number, since it uses less digits than its factorization.
131201420220421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4227875.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 131201420220421 its reverse (124022024102131), we get a palindrome (255223444322552).
The spelling of 131201420220421 in words is "one hundred thirty-one trillion, two hundred one billion, four hundred twenty million, two hundred twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •