Base | Representation |
---|---|
bin | 11010001000110011… |
… | …11100010101100101 |
3 | 1100012221201120022221 |
4 | 31010121330111211 |
5 | 212214313201232 |
6 | 10240234152341 |
7 | 1004511510106 |
oct | 150431742545 |
9 | 40187646287 |
10 | 14032553317 |
11 | 5a51013002 |
12 | 28775826b1 |
13 | 14282990b3 |
14 | 97194c3ad |
15 | 571e13897 |
hex | 34467c565 |
14032553317 has 4 divisors (see below), whose sum is σ = 14033061376. Its totient is φ = 14032045260.
The previous prime is 14032553309. The next prime is 14032553323. The reversal of 14032553317 is 71335523041.
14032553317 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14032553317 - 23 = 14032553309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14032553347) 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, 210063 + ... + 268684.
It is an arithmetic number, because the mean of its divisors is an integer number (3508265344).
Almost surely, 214032553317 is an apocalyptic number.
It is an amenable number.
14032553317 is a deficient number, since it is larger than the sum of its proper divisors (508059).
14032553317 is an equidigital number, since it uses as much as digits as its factorization.
14032553317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508058.
The product of its (nonzero) digits is 37800, while the sum is 34.
The spelling of 14032553317 in words is "fourteen billion, thirty-two million, five hundred fifty-three thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •