Base | Representation |
---|---|
bin | 11011110001110000… |
… | …01111011010100011 |
3 | 1102111022021101001110 |
4 | 31320320033122203 |
5 | 221020201123021 |
6 | 10503443234403 |
7 | 1035361436445 |
oct | 157070173243 |
9 | 42438241043 |
10 | 14912911011 |
11 | 6362a49849 |
12 | 2a82378a03 |
13 | 15387a60cb |
14 | a16834495 |
15 | 5c4360476 |
hex | 378e0f6a3 |
14912911011 has 8 divisors (see below), whose sum is σ = 20209846864. Its totient is φ = 9778957920.
The previous prime is 14912911001. The next prime is 14912911033. The reversal of 14912911011 is 11011921941.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14912911011 - 210 = 14912909987 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 14912911011.
It is not an unprimeable number, because it can be changed into a prime (14912911001) 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 7 ways as a sum of consecutive naturals, for example, 40745476 + ... + 40745841.
It is an arithmetic number, because the mean of its divisors is an integer number (2526230858).
Almost surely, 214912911011 is an apocalyptic number.
14912911011 is a deficient number, since it is larger than the sum of its proper divisors (5296935853).
14912911011 is an equidigital number, since it uses as much as digits as its factorization.
14912911011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81491381.
The product of its (nonzero) digits is 648, while the sum is 30.
The spelling of 14912911011 in words is "fourteen billion, nine hundred twelve million, nine hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •