Base | Representation |
---|---|
bin | 11011010011001111… |
… | …00111000011000001 |
3 | 1101211110112022112101 |
4 | 31221213213003001 |
5 | 220004131034441 |
6 | 10422220030401 |
7 | 1026132351553 |
oct | 155147470301 |
9 | 41743468471 |
10 | 14656893121 |
11 | 6241485812 |
12 | 2a10692401 |
13 | 14c7737530 |
14 | 9d082d4d3 |
15 | 5abb3d231 |
hex | 3699e70c1 |
14656893121 has 4 divisors (see below), whose sum is σ = 15784346452. Its totient is φ = 13529439792.
The previous prime is 14656893101. The next prime is 14656893131. The reversal of 14656893121 is 12139865641.
14656893121 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 3022250625 + 11634642496 = 54975^2 + 107864^2 .
It is a cyclic number.
It is not a de Polignac number, because 14656893121 - 27 = 14656892993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14656893101) 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, 563726646 + ... + 563726671.
It is an arithmetic number, because the mean of its divisors is an integer number (3946086613).
Almost surely, 214656893121 is an apocalyptic number.
It is an amenable number.
14656893121 is a deficient number, since it is larger than the sum of its proper divisors (1127453331).
14656893121 is a wasteful number, since it uses less digits than its factorization.
14656893121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1127453330.
The product of its digits is 311040, while the sum is 46.
The spelling of 14656893121 in words is "fourteen billion, six hundred fifty-six million, eight hundred ninety-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •