Base | Representation |
---|---|
bin | 111101000000110110… |
… | …0110111001010000000 |
3 | 110112012100201200011021 |
4 | 1322001230313022000 |
5 | 4121314402240000 |
6 | 140105253155224 |
7 | 12315631315111 |
oct | 1720154671200 |
9 | 415170650137 |
10 | 131025040000 |
11 | 50627245928 |
12 | 2148802bb14 |
13 | c48136b18a |
14 | 64ad694208 |
15 | 361cd3e11a |
hex | 1e81b37280 |
131025040000 has 80 divisors (see below), whose sum is σ = 326178847170. Its totient is φ = 52409984000.
The previous prime is 131025039931. The next prime is 131025040019. The reversal of 131025040000 is 40520131.
It can be written as a sum of positive squares in 5 ways, for example, as 1810672704 + 129214367296 = 42552^2 + 359464^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1310250400002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 738907 + ... + 898906.
Almost surely, 2131025040000 is an apocalyptic number.
131025040000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131025040000 is an abundant number, since it is smaller than the sum of its proper divisors (195153807170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131025040000 is an frugal number, since it uses more digits than its factorization.
131025040000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1637847 (or 1637820 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
Adding to 131025040000 its reverse (40520131), we get a palindrome (131065560131).
The spelling of 131025040000 in words is "one hundred thirty-one billion, twenty-five million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •