Base | Representation |
---|---|
bin | 11011011000110110… |
… | …11010100110010011 |
3 | 1101221202020000111112 |
4 | 31230123122212103 |
5 | 220103212344201 |
6 | 10431022203535 |
7 | 1030244114306 |
oct | 155433324623 |
9 | 41852200445 |
10 | 14704028051 |
11 | 62660499a9 |
12 | 2a244235ab |
13 | 150442b81b |
14 | 9d6bbcb3d |
15 | 5b0d4e0bb |
hex | 36c6da993 |
14704028051 has 4 divisors (see below), whose sum is σ = 14704434600. Its totient is φ = 14703621504.
The previous prime is 14704028039. The next prime is 14704028057. The reversal of 14704028051 is 15082040741.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15082040741 = 4933 ⋅3057377.
It is a cyclic number.
It is not a de Polignac number, because 14704028051 - 210 = 14704027027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14704027999 and 14704028017.
It is not an unprimeable number, because it can be changed into a prime (14704028057) 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 3 ways as a sum of consecutive naturals, for example, 143081 + ... + 223338.
It is an arithmetic number, because the mean of its divisors is an integer number (3676108650).
Almost surely, 214704028051 is an apocalyptic number.
14704028051 is a deficient number, since it is larger than the sum of its proper divisors (406549).
14704028051 is an equidigital number, since it uses as much as digits as its factorization.
14704028051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406548.
The product of its (nonzero) digits is 8960, while the sum is 32.
Adding to 14704028051 its reverse (15082040741), we get a palindrome (29786068792).
The spelling of 14704028051 in words is "fourteen billion, seven hundred four million, twenty-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •