Base | Representation |
---|---|
bin | 11010000100001100… |
… | …11111100001110011 |
3 | 1100010020222210011001 |
4 | 31002012133201303 |
5 | 212124414301042 |
6 | 10232333502431 |
7 | 1003532121463 |
oct | 150206374163 |
9 | 40106883131 |
10 | 13993900147 |
11 | 5a31212337 |
12 | 2866641a17 |
13 | 14202845b6 |
14 | 96a769ba3 |
15 | 56d82abb7 |
hex | 34219f873 |
13993900147 has 2 divisors, whose sum is σ = 13993900148. Its totient is φ = 13993900146.
The previous prime is 13993900133. The next prime is 13993900187. The reversal of 13993900147 is 74100939931.
13993900147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13993900147 - 219 = 13993375859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13993900097 and 13993900106.
It is not a weakly prime, because it can be changed into another prime (13993900187) 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 as a sum of consecutive naturals, namely, 6996950073 + 6996950074.
It is an arithmetic number, because the mean of its divisors is an integer number (6996950074).
Almost surely, 213993900147 is an apocalyptic number.
13993900147 is a deficient number, since it is larger than the sum of its proper divisors (1).
13993900147 is an equidigital number, since it uses as much as digits as its factorization.
13993900147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 183708, while the sum is 46.
The spelling of 13993900147 in words is "thirteen billion, nine hundred ninety-three million, nine hundred thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •