Base | Representation |
---|---|
bin | 111101101010101110… |
… | …1111111111110110011 |
3 | 110122211022012212222121 |
4 | 1323111131333332303 |
5 | 4132204142231011 |
6 | 140500535415111 |
7 | 12365515040326 |
oct | 1732535777663 |
9 | 418738185877 |
10 | 132430430131 |
11 | 5118858627a |
12 | 217ba824497 |
13 | c64658617c |
14 | 65a41aa7bd |
15 | 36a13eae71 |
hex | 1ed577ffb3 |
132430430131 has 4 divisors (see below), whose sum is σ = 135660440664. Its totient is φ = 129200419600.
The previous prime is 132430430063. The next prime is 132430430173. The reversal of 132430430131 is 131034034231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132430430131 - 233 = 123840495539 is a prime.
It is a super-2 number, since 2×1324304301312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132430430096 and 132430430105.
It is not an unprimeable number, because it can be changed into a prime (132430439131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1615005205 + ... + 1615005286.
It is an arithmetic number, because the mean of its divisors is an integer number (33915110166).
Almost surely, 2132430430131 is an apocalyptic number.
132430430131 is a deficient number, since it is larger than the sum of its proper divisors (3230010533).
132430430131 is an equidigital number, since it uses as much as digits as its factorization.
132430430131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3230010532.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 132430430131 its reverse (131034034231), we get a palindrome (263464464362).
The spelling of 132430430131 in words is "one hundred thirty-two billion, four hundred thirty million, four hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •