Base | Representation |
---|---|
bin | 11010101110001011… |
… | …10100111011110101 |
3 | 1101000210121201010021 |
4 | 31113011310323311 |
5 | 213340042002341 |
6 | 10331313325141 |
7 | 1015336250362 |
oct | 152705647365 |
9 | 41023551107 |
10 | 14346047221 |
11 | 60a1a73680 |
12 | 29445667b1 |
13 | 147820cb4c |
14 | 9a1435469 |
15 | 58e6da9d1 |
hex | 357174ef5 |
14346047221 has 4 divisors (see below), whose sum is σ = 15650233344. Its totient is φ = 13041861100.
The previous prime is 14346047203. The next prime is 14346047239. The reversal of 14346047221 is 12274064341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (14346047203) and next prime (14346047239).
It is a cyclic number.
It is not a de Polignac number, because 14346047221 - 217 = 14345916149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14346047281) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 652093045 + ... + 652093066.
It is an arithmetic number, because the mean of its divisors is an integer number (3912558336).
Almost surely, 214346047221 is an apocalyptic number.
14346047221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14346047221 is a deficient number, since it is larger than the sum of its proper divisors (1304186123).
14346047221 is a wasteful number, since it uses less digits than its factorization.
14346047221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1304186122.
The product of its (nonzero) digits is 32256, while the sum is 34.
The spelling of 14346047221 in words is "fourteen billion, three hundred forty-six million, forty-seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •