Base | Representation |
---|---|
bin | 1101000000100111110010… |
… | …1100001011111000010101 |
3 | 1212122110222120020220102011 |
4 | 3100021330230023320111 |
5 | 3333330233230202321 |
6 | 50231153032344221 |
7 | 3004311464543023 |
oct | 320117454137025 |
9 | 55573876226364 |
10 | 14304333053461 |
11 | 4615485106100 |
12 | 1730338245071 |
13 | 7c9b7b6a5ac9 |
14 | 376494c5d713 |
15 | 19c14dbbeae1 |
hex | d027cb0be15 |
14304333053461 has 24 divisors (see below), whose sum is σ = 15860666172960. Its totient is φ = 12890492530080.
The previous prime is 14304333053459. The next prime is 14304333053473. The reversal of 14304333053461 is 16435033340341.
It is not a de Polignac number, because 14304333053461 - 21 = 14304333053459 is a prime.
It is a super-2 number, since 2×143043330534612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14304333053161) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5824210 + ... + 7907596.
It is an arithmetic number, because the mean of its divisors is an integer number (660861090540).
Almost surely, 214304333053461 is an apocalyptic number.
14304333053461 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14304333053461 is a deficient number, since it is larger than the sum of its proper divisors (1556333119499).
14304333053461 is a wasteful number, since it uses less digits than its factorization.
14304333053461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2083905 (or 2083894 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 40.
The spelling of 14304333053461 in words is "fourteen trillion, three hundred four billion, three hundred thirty-three million, fifty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •