Base | Representation |
---|---|
bin | 11101110010111001101100… |
… | …100000000101001110000100 |
3 | 122011222102102121000111120001 |
4 | 131302321230200011032010 |
5 | 114133440011233102101 |
6 | 1142411310214251044 |
7 | 36413263615304434 |
oct | 3562715440051604 |
9 | 564872377014501 |
10 | 131041272550276 |
11 | 38832323130000 |
12 | 12844815056a84 |
13 | 58171a6449cba |
14 | 2450607bca2c4 |
15 | 1023a3e3b3901 |
hex | 772e6c805384 |
131041272550276 has 45 divisors (see below), whose sum is σ = 252258216174055. Its totient is φ = 59562955589720.
The previous prime is 131041272550273. The next prime is 131041272550297. The reversal of 131041272550276 is 672055272140131.
The square root of 131041272550276 is 11447326.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×1310412725502762 (a number of 29 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131041272550273) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 2770229241 + ... + 2770276543.
Almost surely, 2131041272550276 is an apocalyptic number.
131041272550276 is the 11447326-th square number.
It is an amenable number.
131041272550276 is a deficient number, since it is larger than the sum of its proper divisors (121216943623779).
131041272550276 is an frugal number, since it uses more digits than its factorization.
131041272550276 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94654 (or 47316 counting only the distinct ones).
The product of its (nonzero) digits is 705600, while the sum is 46.
The spelling of 131041272550276 in words is "one hundred thirty-one trillion, forty-one billion, two hundred seventy-two million, five hundred fifty thousand, two hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •