Base | Representation |
---|---|
bin | 11101111000010010000101… |
… | …000001101011111000101011 |
3 | 122020021202220002210012201222 |
4 | 131320102011001223320223 |
5 | 114211014313101400133 |
6 | 1143253223054132255 |
7 | 36452064232050566 |
oct | 3570220501537053 |
9 | 566252802705658 |
10 | 131411051200043 |
11 | 3896512858369a |
12 | 128a44131b108b |
13 | 58430168a2084 |
14 | 24644863a54dd |
15 | 102d482a0ce98 |
hex | 77848506be2b |
131411051200043 has 8 divisors (see below), whose sum is σ = 131481909342000. Its totient is φ = 131340195965440.
The previous prime is 131411051199983. The next prime is 131411051200057. The reversal of 131411051200043 is 340002150114131.
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 131411051200043 - 28 = 131411051199787 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131411051199985 and 131411051200021.
It is not an unprimeable number, because it can be changed into a prime (131411051200073) 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, 92946083 + ... + 94349331.
It is an arithmetic number, because the mean of its divisors is an integer number (16435238667750).
Almost surely, 2131411051200043 is an apocalyptic number.
131411051200043 is a deficient number, since it is larger than the sum of its proper divisors (70858141957).
131411051200043 is a wasteful number, since it uses less digits than its factorization.
131411051200043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1453677.
The product of its (nonzero) digits is 1440, while the sum is 26.
The spelling of 131411051200043 in words is "one hundred thirty-one trillion, four hundred eleven billion, fifty-one million, two hundred thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •