Base | Representation |
---|---|
bin | 11010111000100110… |
… | …01100001000111101 |
3 | 1101020220001112021220 |
4 | 31130103030020331 |
5 | 214024424424341 |
6 | 10344114343553 |
7 | 1020450116661 |
oct | 153423141075 |
9 | 41226045256 |
10 | 14433436221 |
11 | 6137331296 |
12 | 296988abb9 |
13 | 1490359509 |
14 | 9acca28a1 |
15 | 5971eda66 |
hex | 35c4cc23d |
14433436221 has 16 divisors (see below), whose sum is σ = 19352564160. Its totient is φ = 9568379520.
The previous prime is 14433436217. The next prime is 14433436273. The reversal of 14433436221 is 12263433441.
14433436221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14433436221 - 22 = 14433436217 is a prime.
It is a super-2 number, since 2×144334362212 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14433436211) 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 15 ways as a sum of consecutive naturals, for example, 768681 + ... + 787233.
It is an arithmetic number, because the mean of its divisors is an integer number (1209535260).
Almost surely, 214433436221 is an apocalyptic number.
It is an amenable number.
14433436221 is a deficient number, since it is larger than the sum of its proper divisors (4919127939).
14433436221 is a wasteful number, since it uses less digits than its factorization.
14433436221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19996.
The product of its digits is 41472, while the sum is 33.
Adding to 14433436221 its reverse (12263433441), we get a palindrome (26696869662).
The spelling of 14433436221 in words is "fourteen billion, four hundred thirty-three million, four hundred thirty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •