Base | Representation |
---|---|
bin | 11101110010010011010110… |
… | …101010100101001001001011 |
3 | 122011211111011111011012012110 |
4 | 131302103112222211021023 |
5 | 114132301203111430121 |
6 | 1142340341133513403 |
7 | 36410305461442512 |
oct | 3562232652451113 |
9 | 564744144135173 |
10 | 131000104014411 |
11 | 38816917606745 |
12 | 12838845942863 |
13 | 581334526b7c8 |
14 | 244c62035d679 |
15 | 1022930008d76 |
hex | 7724d6aa524b |
131000104014411 has 4 divisors (see below), whose sum is σ = 174666805352552. Its totient is φ = 87333402676272.
The previous prime is 131000104014401. The next prime is 131000104014457. The reversal of 131000104014411 is 114410401000131.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 131000104014411 - 233 = 130991514079819 is a prime.
It is a super-2 number, since 2×1310001040144112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131000104014401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21833350669066 + ... + 21833350669071.
It is an arithmetic number, because the mean of its divisors is an integer number (43666701338138).
Almost surely, 2131000104014411 is an apocalyptic number.
131000104014411 is a deficient number, since it is larger than the sum of its proper divisors (43666701338141).
131000104014411 is an equidigital number, since it uses as much as digits as its factorization.
131000104014411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43666701338140.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 131000104014411 its reverse (114410401000131), we get a palindrome (245410505014542).
The spelling of 131000104014411 in words is "one hundred thirty-one trillion, one hundred four million, fourteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •