Base | Representation |
---|---|
bin | 11011000110111001… |
… | …00100000110111001 |
3 | 1101120020122222101211 |
4 | 31203130210012321 |
5 | 214301123143301 |
6 | 10404040243121 |
7 | 1023434204530 |
oct | 154334440671 |
9 | 41506588354 |
10 | 14553334201 |
11 | 6198a8342a |
12 | 29a1a704a1 |
13 | 14ac148b73 |
14 | 9c0b93317 |
15 | 5a29d4051 |
hex | 3637241b9 |
14553334201 has 8 divisors (see below), whose sum is σ = 16819263360. Its totient is φ = 12334125408.
The previous prime is 14553334199. The next prime is 14553334207. The reversal of 14553334201 is 10243335541.
14553334201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14553334201 - 21 = 14553334199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14553334207) 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 7 ways as a sum of consecutive naturals, for example, 11679421 + ... + 11680666.
It is an arithmetic number, because the mean of its divisors is an integer number (2102407920).
Almost surely, 214553334201 is an apocalyptic number.
It is an amenable number.
14553334201 is a deficient number, since it is larger than the sum of its proper divisors (2265929159).
14553334201 is an equidigital number, since it uses as much as digits as its factorization.
14553334201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23360183.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 14553334201 its reverse (10243335541), we get a palindrome (24796669742).
The spelling of 14553334201 in words is "fourteen billion, five hundred fifty-three million, three hundred thirty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •