Base | Representation |
---|---|
bin | 11101110010110010001101… |
… | …010111100001110000100010 |
3 | 122011221122200101002220222201 |
4 | 131302302031113201300202 |
5 | 114133322030402141120 |
6 | 1142403500420523414 |
7 | 36412560456034300 |
oct | 3562621527416042 |
9 | 564848611086881 |
10 | 131033234021410 |
11 | 38829978637316 |
12 | 12843150b5056a |
13 | 58164c4c36b46 |
14 | 2450084373270 |
15 | 102371d80740a |
hex | 772c8d5e1c22 |
131033234021410 has 48 divisors (see below), whose sum is σ = 274408015335480. Its totient is φ = 44919053867520.
The previous prime is 131033234021407. The next prime is 131033234021423. The reversal of 131033234021410 is 14120432330131.
It can be written as a sum of positive squares in 4 ways, for example, as 93517351770969 + 37515882250441 = 9670437^2 + 6125021^2 .
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 16395255 + ... + 23040634.
Almost surely, 2131033234021410 is an apocalyptic number.
131033234021410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131033234021410 is an abundant number, since it is smaller than the sum of its proper divisors (143374781314070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131033234021410 is a wasteful number, since it uses less digits than its factorization.
131033234021410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39442691 (or 39442684 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 131033234021410 its reverse (14120432330131), we get a palindrome (145153666351541).
The spelling of 131033234021410 in words is "one hundred thirty-one trillion, thirty-three billion, two hundred thirty-four million, twenty-one thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.265 sec. • engine limits •