Base | Representation |
---|---|
bin | 11010101100100011… |
… | …00000111111000101 |
3 | 1100222211211000010222 |
4 | 31112101200333011 |
5 | 213323034142041 |
6 | 10330103354125 |
7 | 1015111554245 |
oct | 152621407705 |
9 | 40884730128 |
10 | 14332334021 |
11 | 6095257755 |
12 | 293ba52945 |
13 | 147541b125 |
14 | 99d6a5b25 |
15 | 58d3cc74b |
hex | 356460fc5 |
14332334021 has 8 divisors (see below), whose sum is σ = 14408155200. Its totient is φ = 14256551232.
The previous prime is 14332334017. The next prime is 14332334033. The reversal of 14332334021 is 12043323341.
14332334021 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 14332334021 - 22 = 14332334017 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 (14332337021) 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, 1034486 + ... + 1048248.
It is an arithmetic number, because the mean of its divisors is an integer number (1801019400).
Almost surely, 214332334021 is an apocalyptic number.
It is an amenable number.
14332334021 is a deficient number, since it is larger than the sum of its proper divisors (75821179).
14332334021 is a wasteful number, since it uses less digits than its factorization.
14332334021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19195.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 14332334021 its reverse (12043323341), we get a palindrome (26375657362).
The spelling of 14332334021 in words is "fourteen billion, three hundred thirty-two million, three hundred thirty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •