Base | Representation |
---|---|
bin | 11001110110000011… |
… | …10100010101100011 |
3 | 1022210222200221000000 |
4 | 30323001310111203 |
5 | 211404024443042 |
6 | 10212454231043 |
7 | 1000561354455 |
oct | 147301642543 |
9 | 38728627000 |
10 | 13875234147 |
11 | 5980231865 |
12 | 2832955483 |
13 | 1401806928 |
14 | 958aba2d5 |
15 | 5631da74c |
hex | 33b074563 |
13875234147 has 56 divisors (see below), whose sum is σ = 21131449920. Its totient is φ = 9105384960.
The previous prime is 13875234137. The next prime is 13875234157. The reversal of 13875234147 is 74143257831.
13875234147 is a `hidden beast` number, since 1 + 3 + 87 + 523 + 4 + 1 + 47 = 666.
13875234147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13875234137) and next prime (13875234157).
It is not a de Polignac number, because 13875234147 - 26 = 13875234083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13875234137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 16899997 + ... + 16900817.
It is an arithmetic number, because the mean of its divisors is an integer number (377347320).
Almost surely, 213875234147 is an apocalyptic number.
13875234147 is a deficient number, since it is larger than the sum of its proper divisors (7256215773).
13875234147 is an frugal number, since it uses more digits than its factorization.
13875234147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1175 (or 1160 counting only the distinct ones).
The product of its digits is 564480, while the sum is 45.
The spelling of 13875234147 in words is "thirteen billion, eight hundred seventy-five million, two hundred thirty-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •