Base | Representation |
---|---|
bin | 11001100111111001… |
… | …00101111111011101 |
3 | 1022111201010202100000 |
4 | 30303330211333131 |
5 | 211133121033112 |
6 | 10153011524513 |
7 | 664616450610 |
oct | 146374457735 |
9 | 38451122300 |
10 | 13756424157 |
11 | 591a163093 |
12 | 27babb9739 |
13 | 13b3008568 |
14 | 946dd0177 |
15 | 557a6c7dc |
hex | 333f25fdd |
13756424157 has 48 divisors (see below), whose sum is σ = 24935444352. Its totient is φ = 7398397440.
The previous prime is 13756424141. The next prime is 13756424159. The reversal of 13756424157 is 75142465731.
13756424157 is a `hidden beast` number, since 1 + 3 + 75 + 6 + 424 + 157 = 666.
It is not a de Polignac number, because 13756424157 - 24 = 13756424141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13756424159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 208944 + ... + 266777.
It is an arithmetic number, because the mean of its divisors is an integer number (519488424).
Almost surely, 213756424157 is an apocalyptic number.
13756424157 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
13756424157 is a deficient number, since it is larger than the sum of its proper divisors (11179020195).
13756424157 is an equidigital number, since it uses as much as digits as its factorization.
13756424157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475760 (or 475748 counting only the distinct ones).
The product of its digits is 705600, while the sum is 45.
Adding to 13756424157 its reverse (75142465731), we get a palindrome (88898889888).
The spelling of 13756424157 in words is "thirteen billion, seven hundred fifty-six million, four hundred twenty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •