Base | Representation |
---|---|
bin | 1100111101100001100111… |
… | …0010011010110010010100 |
3 | 1212110101200001002212020020 |
4 | 3033120121302122302110 |
5 | 3331442310314313234 |
6 | 50150514115105140 |
7 | 3000416250314463 |
oct | 317303162326224 |
9 | 55411601085206 |
10 | 14251134135444 |
11 | 45a4965769658 |
12 | 1721b6bba21b0 |
13 | 7c4b50c85bab |
14 | 373a897469da |
15 | 19aa88592549 |
hex | cf619c9ac94 |
14251134135444 has 48 divisors (see below), whose sum is σ = 34754651261568. Its totient is φ = 4536475406848.
The previous prime is 14251134135443. The next prime is 14251134135449. The reversal of 14251134135444 is 44453143115241.
14251134135444 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14251134135396 and 14251134135405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14251134135443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41672937 + ... + 42013520.
It is an arithmetic number, because the mean of its divisors is an integer number (724055234616).
Almost surely, 214251134135444 is an apocalyptic number.
It is an amenable number.
14251134135444 is an abundant number, since it is smaller than the sum of its proper divisors (20503517126124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14251134135444 is a wasteful number, since it uses less digits than its factorization.
14251134135444 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83687104 (or 83687102 counting only the distinct ones).
The product of its digits is 460800, while the sum is 42.
The spelling of 14251134135444 in words is "fourteen trillion, two hundred fifty-one billion, one hundred thirty-four million, one hundred thirty-five thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •