Base | Representation |
---|---|
bin | 1100111110010010011000… |
… | …0100100110100111111100 |
3 | 1212111122110101010100010122 |
4 | 3033210212010212213330 |
5 | 3332201113113143004 |
6 | 50200521120354112 |
7 | 3001361540042342 |
oct | 317444604464774 |
9 | 55448411110118 |
10 | 14264225131004 |
11 | 45aa473245352 |
12 | 1724604175938 |
13 | 7c6159167a04 |
14 | 37456c1db992 |
15 | 19b0a29bacbe |
hex | cf9261269fc |
14264225131004 has 48 divisors (see below), whose sum is σ = 26075751593472. Its totient is φ = 6814680556992.
The previous prime is 14264225131003. The next prime is 14264225131063. The reversal of 14264225131004 is 40013152246241.
It is a happy number.
It is a super-3 number, since 3×142642251310043 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14264225131003) 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 15 ways as a sum of consecutive naturals, for example, 618746342 + ... + 618769394.
It is an arithmetic number, because the mean of its divisors is an integer number (543244824864).
Almost surely, 214264225131004 is an apocalyptic number.
It is an amenable number.
14264225131004 is a deficient number, since it is larger than the sum of its proper divisors (11811526462468).
14264225131004 is a wasteful number, since it uses less digits than its factorization.
14264225131004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30026 (or 30024 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 35.
Adding to 14264225131004 its reverse (40013152246241), we get a palindrome (54277377377245).
The spelling of 14264225131004 in words is "fourteen trillion, two hundred sixty-four billion, two hundred twenty-five million, one hundred thirty-one thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •