Base | Representation |
---|---|
bin | 11000011101100000… |
… | …01101001110111111 |
3 | 1020220012222001121002 |
4 | 30032300031032333 |
5 | 203343344420111 |
6 | 10011041200515 |
7 | 643301504603 |
oct | 141660151677 |
9 | 36805861532 |
10 | 13132420031 |
11 | 56299aa5a5 |
12 | 266603013b |
13 | 1313956b53 |
14 | 8c8199503 |
15 | 51cdac63b |
hex | 30ec0d3bf |
13132420031 has 8 divisors (see below), whose sum is σ = 13439655504. Its totient is φ = 12825267840.
The previous prime is 13132419997. The next prime is 13132420039. The reversal of 13132420031 is 13002423131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13132420031 - 26 = 13132419967 is a prime.
It is a super-2 number, since 2×131324200312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13132419985 and 13132420012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13132420039) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 393365 + ... + 425441.
It is an arithmetic number, because the mean of its divisors is an integer number (1679956938).
Almost surely, 213132420031 is an apocalyptic number.
13132420031 is a deficient number, since it is larger than the sum of its proper divisors (307235473).
13132420031 is an equidigital number, since it uses as much as digits as its factorization.
13132420031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41641.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13132420031 its reverse (13002423131), we get a palindrome (26134843162).
The spelling of 13132420031 in words is "thirteen billion, one hundred thirty-two million, four hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •