Base | Representation |
---|---|
bin | 11101110010010011010000… |
… | …101110010001110010100111 |
3 | 122011211110220112120012202112 |
4 | 131302103100232101302213 |
5 | 114132301002101223143 |
6 | 1142340323213031235 |
7 | 36410303141163500 |
oct | 3562232056216247 |
9 | 564743815505675 |
10 | 131000004320423 |
11 | 38816876304117 |
12 | 1283881848551b |
13 | 581332a704394 |
14 | 244c61100bba7 |
15 | 10229263b4e18 |
hex | 7724d0b91ca7 |
131000004320423 has 6 divisors (see below), whose sum is σ = 152387760127896. Its totient is φ = 112285717988892.
The previous prime is 131000004320399. The next prime is 131000004320441. The reversal of 131000004320423 is 324023400000131.
It is not a de Polignac number, because 131000004320423 - 216 = 131000004254887 is a prime.
It is a super-2 number, since 2×1310000043204232 (a number of 29 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 (131000004320483) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1336734737915 + ... + 1336734738012.
It is an arithmetic number, because the mean of its divisors is an integer number (25397960021316).
Almost surely, 2131000004320423 is an apocalyptic number.
131000004320423 is a deficient number, since it is larger than the sum of its proper divisors (21387755807473).
131000004320423 is an equidigital number, since it uses as much as digits as its factorization.
131000004320423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2673469475941 (or 2673469475934 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 131000004320423 its reverse (324023400000131), we get a palindrome (455023404320554).
The spelling of 131000004320423 in words is "one hundred thirty-one trillion, four million, three hundred twenty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •