Base | Representation |
---|---|
bin | 11011010110011000… |
… | …01110011000110001 |
3 | 1101220022011022222002 |
4 | 31223030032120301 |
5 | 220032404044112 |
6 | 10425001223345 |
7 | 1026602503301 |
oct | 155314163061 |
9 | 41808138862 |
10 | 14683268657 |
11 | 6255360082 |
12 | 2a19491b55 |
13 | 1500040865 |
14 | 9d4137601 |
15 | 5ae0ed1c2 |
hex | 36b30e631 |
14683268657 has 4 divisors (see below), whose sum is σ = 14688410916. Its totient is φ = 14678126400.
The previous prime is 14683268653. The next prime is 14683268687. The reversal of 14683268657 is 75686238641.
14683268657 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11806126336 + 2877142321 = 108656^2 + 53639^2 .
It is a cyclic number.
It is not a de Polignac number, because 14683268657 - 22 = 14683268653 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14683268653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2566844 + ... + 2572557.
It is an arithmetic number, because the mean of its divisors is an integer number (3672102729).
Almost surely, 214683268657 is an apocalyptic number.
It is an amenable number.
14683268657 is a deficient number, since it is larger than the sum of its proper divisors (5142259).
14683268657 is an equidigital number, since it uses as much as digits as its factorization.
14683268657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5142258.
The product of its digits is 11612160, while the sum is 56.
The spelling of 14683268657 in words is "fourteen billion, six hundred eighty-three million, two hundred sixty-eight thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •