Base | Representation |
---|---|
bin | 11101110010111101011001… |
… | …110010001111010100110010 |
3 | 122011222210201000220020021110 |
4 | 131302331121302033110302 |
5 | 114134021134344313300 |
6 | 1142413205224134150 |
7 | 36413464355021346 |
oct | 3562753162172462 |
9 | 564883630806243 |
10 | 131045253510450 |
11 | 38833a8629a334 |
12 | 12845546307356 |
13 | 581768c133336 |
14 | 24508a47c5626 |
15 | 1023bc3b27550 |
hex | 772f59c8f532 |
131045253510450 has 24 divisors (see below), whose sum is σ = 324992228706288. Its totient is φ = 34945400936080.
The previous prime is 131045253510419. The next prime is 131045253510511. The reversal of 131045253510450 is 54015352540131.
It is a junction number, because it is equal to n+sod(n) for n = 131045253510399 and 131045253510408.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 436817511552 + ... + 436817511851.
It is an arithmetic number, because the mean of its divisors is an integer number (13541342862762).
Almost surely, 2131045253510450 is an apocalyptic number.
131045253510450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131045253510450 is an abundant number, since it is smaller than the sum of its proper divisors (193946975195838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131045253510450 is a wasteful number, since it uses less digits than its factorization.
131045253510450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 873635023418 (or 873635023413 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 39.
The spelling of 131045253510450 in words is "one hundred thirty-one trillion, forty-five billion, two hundred fifty-three million, five hundred ten thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •