Base | Representation |
---|---|
bin | 11011100000101001… |
… | …11011011011101001 |
3 | 1102010022022002212201 |
4 | 31300110323123221 |
5 | 220221433431033 |
6 | 10441320140201 |
7 | 1032000065215 |
oct | 156024733351 |
9 | 42108262781 |
10 | 14769436393 |
11 | 6299a64188 |
12 | 2a42307661 |
13 | 1514b5039a |
14 | a01767945 |
15 | 5b696e47d |
hex | 37053b6e9 |
14769436393 has 4 divisors (see below), whose sum is σ = 14769684180. Its totient is φ = 14769188608.
The previous prime is 14769436349. The next prime is 14769436399. The reversal of 14769436393 is 39363496741.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 39363496741 = 26393 ⋅1491437.
It can be written as a sum of positive squares in 2 ways, for example, as 2916324009 + 11853112384 = 54003^2 + 108872^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14769436393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14769436399) 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, 25821 + ... + 173797.
It is an arithmetic number, because the mean of its divisors is an integer number (3692421045).
Almost surely, 214769436393 is an apocalyptic number.
It is an amenable number.
14769436393 is a deficient number, since it is larger than the sum of its proper divisors (247787).
14769436393 is an equidigital number, since it uses as much as digits as its factorization.
14769436393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247786.
The product of its digits is 8817984, while the sum is 55.
The spelling of 14769436393 in words is "fourteen billion, seven hundred sixty-nine million, four hundred thirty-six thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •