Base | Representation |
---|---|
bin | 11011011001001101… |
… | …10000011011011011 |
3 | 1101221221211001200122 |
4 | 31230212300123123 |
5 | 220104443013201 |
6 | 10431210023455 |
7 | 1030311306041 |
oct | 155446603333 |
9 | 41857731618 |
10 | 14707001051 |
11 | 626779a626 |
12 | 2a25417b8b |
13 | 1504c2cab2 |
14 | 9d7354391 |
15 | 5b1239e1b |
hex | 36c9b06db |
14707001051 has 4 divisors (see below), whose sum is σ = 14712176952. Its totient is φ = 14701825152.
The previous prime is 14707001047. The next prime is 14707001081. The reversal of 14707001051 is 15010070741.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15010070741 = 18211 ⋅824231.
It is a cyclic number.
It is not a de Polignac number, because 14707001051 - 22 = 14707001047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14707001051.
It is not an unprimeable number, because it can be changed into a prime (14707001081) 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, 2583686 + ... + 2589371.
It is an arithmetic number, because the mean of its divisors is an integer number (3678044238).
Almost surely, 214707001051 is an apocalyptic number.
14707001051 is a deficient number, since it is larger than the sum of its proper divisors (5175901).
14707001051 is an equidigital number, since it uses as much as digits as its factorization.
14707001051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5175900.
The product of its (nonzero) digits is 980, while the sum is 26.
Adding to 14707001051 its reverse (15010070741), we get a palindrome (29717071792).
The spelling of 14707001051 in words is "fourteen billion, seven hundred seven million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •