Base | Representation |
---|---|
bin | 11011101010011011… |
… | …11110100000010011 |
3 | 1102100000201101001110 |
4 | 31311031332200103 |
5 | 220403441000201 |
6 | 10453411104403 |
7 | 1034014444653 |
oct | 156515764023 |
9 | 42300641043 |
10 | 14851500051 |
11 | 6331314893 |
12 | 2a658a2103 |
13 | 1528b53b6b |
14 | a0c60a363 |
15 | 5bdc7e6d6 |
hex | 37537e813 |
14851500051 has 4 divisors (see below), whose sum is σ = 19802000072. Its totient is φ = 9901000032.
The previous prime is 14851500049. The next prime is 14851500071. The reversal of 14851500051 is 15000515841.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 14851500051 - 21 = 14851500049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14851499991 and 14851500018.
It is not an unprimeable number, because it can be changed into a prime (14851500071) 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, 2475250006 + ... + 2475250011.
It is an arithmetic number, because the mean of its divisors is an integer number (4950500018).
Almost surely, 214851500051 is an apocalyptic number.
14851500051 is a deficient number, since it is larger than the sum of its proper divisors (4950500021).
14851500051 is an equidigital number, since it uses as much as digits as its factorization.
14851500051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4950500020.
The product of its (nonzero) digits is 4000, while the sum is 30.
The spelling of 14851500051 in words is "fourteen billion, eight hundred fifty-one million, five hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •