Base | Representation |
---|---|
bin | 11010101100110111… |
… | …01101010110110011 |
3 | 1101000000211202121000 |
4 | 31112123231112303 |
5 | 213324230144011 |
6 | 10330240533043 |
7 | 1015143353535 |
oct | 152633552663 |
9 | 41000752530 |
10 | 14335006131 |
11 | 6096812306 |
12 | 2940921183 |
13 | 1475b45464 |
14 | 99db9d855 |
15 | 58d759356 |
hex | 3566ed5b3 |
14335006131 has 32 divisors (see below), whose sum is σ = 21555110720. Its totient is φ = 9413874432.
The previous prime is 14335006129. The next prime is 14335006139. The reversal of 14335006131 is 13160053341.
14335006131 is a `hidden beast` number, since 1 + 43 + 3 + 5 + 0 + 0 + 613 + 1 = 666.
It is not a de Polignac number, because 14335006131 - 21 = 14335006129 is a prime.
It is a super-2 number, since 2×143350061312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14335006095 and 14335006104.
It is not an unprimeable number, because it can be changed into a prime (14335006139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1724421 + ... + 1732713.
It is an arithmetic number, because the mean of its divisors is an integer number (673597210).
Almost surely, 214335006131 is an apocalyptic number.
14335006131 is a deficient number, since it is larger than the sum of its proper divisors (7220104589).
14335006131 is an equidigital number, since it uses as much as digits as its factorization.
14335006131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9252 (or 9246 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 14335006131 its reverse (13160053341), we get a palindrome (27495059472).
The spelling of 14335006131 in words is "fourteen billion, three hundred thirty-five million, six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •