Base | Representation |
---|---|
bin | 11101111000011010110010… |
… | …100011101000111001111011 |
3 | 122020022200000222121222211101 |
4 | 131320122302203220321323 |
5 | 114211142442140310133 |
6 | 1143301411154512231 |
7 | 36452545102114642 |
oct | 3570326243507173 |
9 | 566280028558741 |
10 | 131420405010043 |
11 | 38969098561586 |
12 | 128a61a3895677 |
13 | 5843b777407a6 |
14 | 2464ad279a359 |
15 | 102d82dcc737d |
hex | 7786b28e8e7b |
131420405010043 has 8 divisors (see below), whose sum is σ = 132302880050400. Its totient is φ = 130537936088640.
The previous prime is 131420405010031. The next prime is 131420405010079. The reversal of 131420405010043 is 340010504024131.
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 131420405010043 - 233 = 131411815075451 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131420405009993 and 131420405010020.
It is not an unprimeable number, because it can be changed into a prime (131420405011043) 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, 46646263 + ... + 49383343.
It is an arithmetic number, because the mean of its divisors is an integer number (16537860006300).
Almost surely, 2131420405010043 is an apocalyptic number.
131420405010043 is a deficient number, since it is larger than the sum of its proper divisors (882475040357).
131420405010043 is a wasteful number, since it uses less digits than its factorization.
131420405010043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3059477.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 131420405010043 its reverse (340010504024131), we get a palindrome (471430909034174).
The spelling of 131420405010043 in words is "one hundred thirty-one trillion, four hundred twenty billion, four hundred five million, ten thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •