Base | Representation |
---|---|
bin | 11010001011010000… |
… | …11010000100100001 |
3 | 1100021101102120201111 |
4 | 31011220122010201 |
5 | 212240044403322 |
6 | 10242251103321 |
7 | 1005151366102 |
oct | 150550320441 |
9 | 40241376644 |
10 | 14053122337 |
11 | 5a616918a1 |
12 | 2882441b41 |
13 | 142c61b507 |
14 | 9745843a9 |
15 | 573b28177 |
hex | 345a1a121 |
14053122337 has 8 divisors (see below), whose sum is σ = 15137164800. Its totient is φ = 13008499680.
The previous prime is 14053122319. The next prime is 14053122359. The reversal of 14053122337 is 73322135041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14053122337 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 14053122299 and 14053122308.
It is not an unprimeable number, because it can be changed into a prime (14053122737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9854212 + ... + 9855637.
It is an arithmetic number, because the mean of its divisors is an integer number (1892145600).
Almost surely, 214053122337 is an apocalyptic number.
It is an amenable number.
14053122337 is a deficient number, since it is larger than the sum of its proper divisors (1084042463).
14053122337 is a wasteful number, since it uses less digits than its factorization.
14053122337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19709903.
The product of its (nonzero) digits is 15120, while the sum is 31.
Adding to 14053122337 its reverse (73322135041), we get a palindrome (87375257378).
The spelling of 14053122337 in words is "fourteen billion, fifty-three million, one hundred twenty-two thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •