Base | Representation |
---|---|
bin | 1111100111011… |
… | …11111111100011 |
3 | 100010111211001012 |
4 | 13303233333203 |
5 | 232014201220 |
6 | 20555531135 |
7 | 3150351650 |
oct | 763577743 |
9 | 303454035 |
10 | 131006435 |
11 | 67a4a08a |
12 | 37a59aab |
13 | 211ab901 |
14 | 13582c27 |
15 | b77bac5 |
hex | 7ceffe3 |
131006435 has 8 divisors (see below), whose sum is σ = 179666016. Its totient is φ = 89832960.
The previous prime is 131006429. The next prime is 131006441. The reversal of 131006435 is 534600131.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (131006429) and next prime (131006441).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131006435 - 214 = 130990051 is a prime.
It is a super-2 number, since 2×1310064352 = 34325372022818450, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131006435.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1871486 + ... + 1871555.
It is an arithmetic number, because the mean of its divisors is an integer number (22458252).
Almost surely, 2131006435 is an apocalyptic number.
131006435 is a deficient number, since it is larger than the sum of its proper divisors (48659581).
131006435 is an equidigital number, since it uses as much as digits as its factorization.
131006435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3743053.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 131006435 is about 11445.8042530877. The cubic root of 131006435 is about 507.8836236507.
Adding to 131006435 its reverse (534600131), we get a palindrome (665606566).
The spelling of 131006435 in words is "one hundred thirty-one million, six thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •