Base | Representation |
---|---|
bin | 11010010011011111… |
… | …01000010000101101 |
3 | 1100110012021020122222 |
4 | 31021233220100231 |
5 | 212410230434313 |
6 | 10253154045125 |
7 | 1006650035102 |
oct | 151157502055 |
9 | 40405236588 |
10 | 14122124333 |
11 | 5a97631039 |
12 | 28a15797a5 |
13 | 14409ca9b5 |
14 | 97d7c6aa9 |
15 | 579c08208 |
hex | 349be842d |
14122124333 has 8 divisors (see below), whose sum is σ = 14145049920. Its totient is φ = 14099218560.
The previous prime is 14122124329. The next prime is 14122124347. The reversal of 14122124333 is 33342122141.
14122124333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14122124333 - 22 = 14122124329 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 (14122124323) 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 7 ways as a sum of consecutive naturals, for example, 2051888 + ... + 2058758.
It is an arithmetic number, because the mean of its divisors is an integer number (1768131240).
Almost surely, 214122124333 is an apocalyptic number.
It is an amenable number.
14122124333 is a deficient number, since it is larger than the sum of its proper divisors (22925587).
14122124333 is a wasteful number, since it uses less digits than its factorization.
14122124333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9907.
The product of its digits is 3456, while the sum is 26.
Adding to 14122124333 its reverse (33342122141), we get a palindrome (47464246474).
The spelling of 14122124333 in words is "fourteen billion, one hundred twenty-two million, one hundred twenty-four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •