Base | Representation |
---|---|
bin | 1100110000010100010000… |
… | …0100011011001101000101 |
3 | 1211122200221022202011201201 |
4 | 3030011010010123031011 |
5 | 3314233040304412013 |
6 | 45454344440222501 |
7 | 2645134001052523 |
oct | 314050404331505 |
9 | 54580838664651 |
10 | 14024210232133 |
11 | 45176a807a3a2 |
12 | 16a5b9b76aa31 |
13 | 7a962897a9aa |
14 | 366abd991313 |
15 | 194c065ba3dd |
hex | cc14411b345 |
14024210232133 has 8 divisors (see below), whose sum is σ = 14762367702720. Its totient is φ = 13286056875840.
The previous prime is 14024210232121. The next prime is 14024210232161. The reversal of 14024210232133 is 33123201242041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14024210232133 - 29 = 14024210231621 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 (14024210232233) 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, 8000541 + ... + 9594637.
It is an arithmetic number, because the mean of its divisors is an integer number (1845295962840).
Almost surely, 214024210232133 is an apocalyptic number.
It is an amenable number.
14024210232133 is a deficient number, since it is larger than the sum of its proper divisors (738157470587).
14024210232133 is a wasteful number, since it uses less digits than its factorization.
14024210232133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2057147.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 14024210232133 its reverse (33123201242041), we get a palindrome (47147411474174).
The spelling of 14024210232133 in words is "fourteen trillion, twenty-four billion, two hundred ten million, two hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •