Base | Representation |
---|---|
bin | 11011000100011111… |
… | …11000101000111011 |
3 | 1101111211211202000201 |
4 | 31202033320220323 |
5 | 214231001430321 |
6 | 10402041343031 |
7 | 1023101305210 |
oct | 154217705073 |
9 | 41454752021 |
10 | 14533233211 |
11 | 61886a4242 |
12 | 2997197a77 |
13 | 14a7c2b7a3 |
14 | 9bc23db07 |
15 | 5a0d63291 |
hex | 3623f8a3b |
14533233211 has 4 divisors (see below), whose sum is σ = 16609409392. Its totient is φ = 12457057032.
The previous prime is 14533233193. The next prime is 14533233227. The reversal of 14533233211 is 11233233541.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 14533233211 - 217 = 14533102139 is a prime.
It is a super-2 number, since 2×145332332112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14533233211.
It is not an unprimeable number, because it can be changed into a prime (14533230211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1038088080 + ... + 1038088093.
It is an arithmetic number, because the mean of its divisors is an integer number (4152352348).
Almost surely, 214533233211 is an apocalyptic number.
14533233211 is a deficient number, since it is larger than the sum of its proper divisors (2076176181).
14533233211 is an equidigital number, since it uses as much as digits as its factorization.
14533233211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2076176180.
The product of its digits is 6480, while the sum is 28.
Adding to 14533233211 its reverse (11233233541), we get a palindrome (25766466752).
The spelling of 14533233211 in words is "fourteen billion, five hundred thirty-three million, two hundred thirty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •