Base | Representation |
---|---|
bin | 11011110111100011… |
… | …01000010100011101 |
3 | 1102121200201102212110 |
4 | 31323301220110131 |
5 | 221120121302121 |
6 | 10512341024233 |
7 | 1036521506460 |
oct | 157361502435 |
9 | 42550642773 |
10 | 14961509661 |
11 | 638842271a |
12 | 2a966b5079 |
13 | 15458906c7 |
14 | a1d0852d7 |
15 | 5c875ed76 |
hex | 37bc6851d |
14961509661 has 8 divisors (see below), whose sum is σ = 22798490944. Its totient is φ = 8549434080.
The previous prime is 14961509657. The next prime is 14961509723. The reversal of 14961509661 is 16690516941.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14961509661 - 22 = 14961509657 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14961509661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14961509611) 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, 356226400 + ... + 356226441.
It is an arithmetic number, because the mean of its divisors is an integer number (2849811368).
Almost surely, 214961509661 is an apocalyptic number.
It is an amenable number.
14961509661 is a deficient number, since it is larger than the sum of its proper divisors (7836981283).
14961509661 is an equidigital number, since it uses as much as digits as its factorization.
14961509661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712452851.
The product of its (nonzero) digits is 349920, while the sum is 48.
The spelling of 14961509661 in words is "fourteen billion, nine hundred sixty-one million, five hundred nine thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •