Base | Representation |
---|---|
bin | 1100111011110001110000… |
… | …1110010111001011000001 |
3 | 1212100112011121212011000001 |
4 | 3032330130032113023001 |
5 | 3330444313210302113 |
6 | 50125030551000001 |
7 | 2665304240411410 |
oct | 316743416271301 |
9 | 55315147764001 |
10 | 14221110244033 |
11 | 4593158a97660 |
12 | 1718191069001 |
13 | 7c2077977384 |
14 | 37243c07d477 |
15 | 199dcc7e97dd |
hex | cef1c3972c1 |
14221110244033 has 64 divisors (see below), whose sum is σ = 18455823138816. Its totient is φ = 10634053248000.
The previous prime is 14221110243941. The next prime is 14221110244043. The reversal of 14221110244033 is 33044201112241.
It is a happy number.
It is not a de Polignac number, because 14221110244033 - 213 = 14221110235841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14221110243992 and 14221110244010.
It is not an unprimeable number, because it can be changed into a prime (14221110244043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 306393598 + ... + 306440008.
It is an arithmetic number, because the mean of its divisors is an integer number (288372236544).
Almost surely, 214221110244033 is an apocalyptic number.
It is an amenable number.
14221110244033 is a deficient number, since it is larger than the sum of its proper divisors (4234712894783).
14221110244033 is a wasteful number, since it uses less digits than its factorization.
14221110244033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47534.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 14221110244033 its reverse (33044201112241), we get a palindrome (47265311356274).
The spelling of 14221110244033 in words is "fourteen trillion, two hundred twenty-one billion, one hundred ten million, two hundred forty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •