Base | Representation |
---|---|
bin | 1100110001111111111000… |
… | …1101101111011101011001 |
3 | 1211202110111220122220111120 |
4 | 3030133332031233131121 |
5 | 3320221223334242340 |
6 | 45515523441315453 |
7 | 2650205664633135 |
oct | 314377615573531 |
9 | 54673456586446 |
10 | 14053103040345 |
11 | 4528984336896 |
12 | 16ab703935b89 |
13 | 7ac281844805 |
14 | 368260d483c5 |
15 | 195847ddc4d0 |
hex | cc7fe36f759 |
14053103040345 has 32 divisors (see below), whose sum is σ = 24096695622912. Its totient is φ = 6975359246592.
The previous prime is 14053103040331. The next prime is 14053103040367. The reversal of 14053103040345 is 54304030135041.
It is not a de Polignac number, because 14053103040345 - 211 = 14053103038297 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 550441722 + ... + 550467251.
It is an arithmetic number, because the mean of its divisors is an integer number (753021738216).
Almost surely, 214053103040345 is an apocalyptic number.
14053103040345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14053103040345 is a deficient number, since it is larger than the sum of its proper divisors (10043592582567).
14053103040345 is a wasteful number, since it uses less digits than its factorization.
14053103040345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100909041.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 14053103040345 its reverse (54304030135041), we get a palindrome (68357133175386).
The spelling of 14053103040345 in words is "fourteen trillion, fifty-three billion, one hundred three million, forty thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •