Base | Representation |
---|---|
bin | 1100110001010011100101… |
… | …0110101000100011110001 |
3 | 1211201022211002102101100111 |
4 | 3030110321112220203301 |
5 | 3320022344320401413 |
6 | 45510235403221321 |
7 | 2646305165342260 |
oct | 314247126504361 |
9 | 54638732371314 |
10 | 14041210325233 |
11 | 45239311a1a13 |
12 | 16a9344b17841 |
13 | 7ab1079a4590 |
14 | 3678536965d7 |
15 | 19539dcaed3d |
hex | cc5395a88f1 |
14041210325233 has 32 divisors (see below), whose sum is σ = 17651950348032. Its totient is φ = 10873699200000.
The previous prime is 14041210325213. The next prime is 14041210325239. The reversal of 14041210325233 is 33252301214041.
It is a de Polignac number, because none of the positive numbers 2k-14041210325233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14041210325195 and 14041210325204.
It is not an unprimeable number, because it can be changed into a prime (14041210325239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7197268 + ... + 8937733.
It is an arithmetic number, because the mean of its divisors is an integer number (551623448376).
Almost surely, 214041210325233 is an apocalyptic number.
14041210325233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
14041210325233 is a deficient number, since it is larger than the sum of its proper divisors (3610740022799).
14041210325233 is a wasteful number, since it uses less digits than its factorization.
14041210325233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16135225.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 14041210325233 its reverse (33252301214041), we get a palindrome (47293511539274).
The spelling of 14041210325233 in words is "fourteen trillion, forty-one billion, two hundred ten million, three hundred twenty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •