Base | Representation |
---|---|
bin | 11010101101000011… |
… | …11110110000100001 |
3 | 1101000010221021221011 |
4 | 31112201332300201 |
5 | 213330140302043 |
6 | 10330340100521 |
7 | 1015163342131 |
oct | 152641766041 |
9 | 41003837834 |
10 | 14336650273 |
11 | 6097735600 |
12 | 2941394741 |
13 | 147629c91a |
14 | 9a00aaac1 |
15 | 58d98159d |
hex | 35687ec21 |
14336650273 has 12 divisors (see below), whose sum is σ = 16685437860. Its totient is φ = 12266650880.
The previous prime is 14336650267. The next prime is 14336650301. The reversal of 14336650273 is 37205663341.
14336650273 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9644811264 + 4691839009 = 98208^2 + 68497^2 .
It is a de Polignac number, because none of the positive numbers 2k-14336650273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14336650213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3482788 + ... + 3486901.
It is an arithmetic number, because the mean of its divisors is an integer number (1390453155).
Almost surely, 214336650273 is an apocalyptic number.
It is an amenable number.
14336650273 is a deficient number, since it is larger than the sum of its proper divisors (2348787587).
14336650273 is a wasteful number, since it uses less digits than its factorization.
14336650273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6969728 (or 6969717 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 40.
The spelling of 14336650273 in words is "fourteen billion, three hundred thirty-six million, six hundred fifty thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •