Base | Representation |
---|---|
bin | 1100111101000001100001… |
… | …0110111100011101011100 |
3 | 1212102120102201111200202122 |
4 | 3033100120112330131130 |
5 | 3331322140134042112 |
6 | 50142531245042112 |
7 | 2666662633255031 |
oct | 317203026743534 |
9 | 55376381450678 |
10 | 14242520221532 |
11 | 45a12453aa639 |
12 | 1720367256338 |
13 | 7c40aa4b5005 |
14 | 3734ad713388 |
15 | 19a73222b872 |
hex | cf4185bc75c |
14242520221532 has 24 divisors (see below), whose sum is σ = 25233314512896. Its totient is φ = 7033504686768.
The previous prime is 14242520221411. The next prime is 14242520221537. The reversal of 14242520221532 is 23512202524241.
It is a junction number, because it is equal to n+sod(n) for n = 14242520221492 and 14242520221501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14242520221537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62748728 + ... + 62975295.
It is an arithmetic number, because the mean of its divisors is an integer number (1051388104704).
Almost surely, 214242520221532 is an apocalyptic number.
It is an amenable number.
14242520221532 is a deficient number, since it is larger than the sum of its proper divisors (10990794291364).
14242520221532 is a wasteful number, since it uses less digits than its factorization.
14242520221532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125724377 (or 125724375 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 35.
Adding to 14242520221532 its reverse (23512202524241), we get a palindrome (37754722745773).
The spelling of 14242520221532 in words is "fourteen trillion, two hundred forty-two billion, five hundred twenty million, two hundred twenty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •