Base | Representation |
---|---|
bin | 111101000100000100… |
… | …1011101111001011010 |
3 | 110112110220020212112122 |
4 | 1322020021131321122 |
5 | 4122030044431020 |
6 | 140124115341242 |
7 | 12321413553206 |
oct | 1721011357132 |
9 | 415426225478 |
10 | 131133202010 |
11 | 50682301618 |
12 | 214b82b1822 |
13 | c49a8aba75 |
14 | 64bdbabb06 |
15 | 36275a7125 |
hex | 1e8825de5a |
131133202010 has 8 divisors (see below), whose sum is σ = 236039763636. Its totient is φ = 52453280800.
The previous prime is 131133202001. The next prime is 131133202033. The reversal of 131133202010 is 10202331131.
It can be written as a sum of positive squares in 2 ways, for example, as 108228498361 + 22904703649 = 328981^2 + 151343^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 131133202010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6556660091 + ... + 6556660110.
Almost surely, 2131133202010 is an apocalyptic number.
131133202010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131133202010 is a deficient number, since it is larger than the sum of its proper divisors (104906561626).
131133202010 is a wasteful number, since it uses less digits than its factorization.
131133202010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13113320208.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 131133202010 its reverse (10202331131), we get a palindrome (141335533141).
It can be divided in two parts, 13113 and 3202010, that added together give a palindrome (3215123).
The spelling of 131133202010 in words is "one hundred thirty-one billion, one hundred thirty-three million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •