Base | Representation |
---|---|
bin | 1100111011010100000000… |
… | …1001100001100011100000 |
3 | 1212022202112222111011211122 |
4 | 3032311000021201203200 |
5 | 3330331433443133044 |
6 | 50121230225031412 |
7 | 2664602303215064 |
oct | 316650011414340 |
9 | 55282488434748 |
10 | 14213123021024 |
11 | 458a82a456804 |
12 | 1716722185568 |
13 | 7c13a3c88b05 |
14 | 371cc137daa4 |
15 | 199ab14c4dee |
hex | ced402618e0 |
14213123021024 has 48 divisors (see below), whose sum is σ = 28083596866416. Its totient is φ = 7080806937600.
The previous prime is 14213123021021. The next prime is 14213123021039. The reversal of 14213123021024 is 42012032131241.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 14213123020984 and 14213123021002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14213123021021) 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, 17146034 + ... + 17955854.
It is an arithmetic number, because the mean of its divisors is an integer number (585074934717).
Almost surely, 214213123021024 is an apocalyptic number.
It is an amenable number.
14213123021024 is a deficient number, since it is larger than the sum of its proper divisors (13870473845392).
14213123021024 is a wasteful number, since it uses less digits than its factorization.
14213123021024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811819 (or 811811 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 14213123021024 its reverse (42012032131241), we get a palindrome (56225155152265).
The spelling of 14213123021024 in words is "fourteen trillion, two hundred thirteen billion, one hundred twenty-three million, twenty-one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •