Base | Representation |
---|---|
bin | 11101110010011110100011… |
… | …101110010000011011010100 |
3 | 122011212122012220011002000101 |
4 | 131302132203232100123110 |
5 | 114133000322331221004 |
6 | 1142350051003223444 |
7 | 36411212550623401 |
oct | 3562364356203324 |
9 | 564778186132011 |
10 | 131012134242004 |
11 | 38820a303337a4 |
12 | 1283b042817b84 |
13 | 5814511757a82 |
14 | 244d041da92a8 |
15 | 1022dd624aba4 |
hex | 7727a3b906d4 |
131012134242004 has 6 divisors (see below), whose sum is σ = 229271234923514. Its totient is φ = 65506067121000.
The previous prime is 131012134242001. The next prime is 131012134242049. The reversal of 131012134242004 is 400242431210131.
It is a happy number.
131012134242004 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 130431292105104 + 580842136900 = 11420652^2 + 762130^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012134242001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16376516780247 + ... + 16376516780254.
Almost surely, 2131012134242004 is an apocalyptic number.
It is an amenable number.
131012134242004 is a deficient number, since it is larger than the sum of its proper divisors (98259100681510).
131012134242004 is a wasteful number, since it uses less digits than its factorization.
131012134242004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32753033560505 (or 32753033560503 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 131012134242004 its reverse (400242431210131), we get a palindrome (531254565452135).
The spelling of 131012134242004 in words is "one hundred thirty-one trillion, twelve billion, one hundred thirty-four million, two hundred forty-two thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •