Base | Representation |
---|---|
bin | 111101001100100111… |
… | …1101011001101110101 |
3 | 110120012212222212011201 |
4 | 1322121033223031311 |
5 | 4123122012321401 |
6 | 140212403332501 |
7 | 12331465632535 |
oct | 1723117531565 |
9 | 416185885151 |
10 | 131420042101 |
11 | 5080a207847 |
12 | 21578381131 |
13 | c51514c92a |
14 | 6509d174c5 |
15 | 3642866b01 |
hex | 1e993eb375 |
131420042101 has 8 divisors (see below), whose sum is σ = 132310299680. Its totient is φ = 130530809232.
The previous prime is 131420042093. The next prime is 131420042129. The reversal of 131420042101 is 101240024131.
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 131420042101 - 23 = 131420042093 is a prime.
It is a super-2 number, since 2×1314200421012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131420042141) 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, 2071 + ... + 512683.
It is an arithmetic number, because the mean of its divisors is an integer number (16538787460).
Almost surely, 2131420042101 is an apocalyptic number.
It is an amenable number.
131420042101 is a deficient number, since it is larger than the sum of its proper divisors (890257579).
131420042101 is a wasteful number, since it uses less digits than its factorization.
131420042101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 512355.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 131420042101 its reverse (101240024131), we get a palindrome (232660066232).
The spelling of 131420042101 in words is "one hundred thirty-one billion, four hundred twenty million, forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •