Base | Representation |
---|---|
bin | 1100111111010100100101… |
… | …0001010001010001010000 |
3 | 1212120100022211020210101210 |
4 | 3033311021101101101100 |
5 | 3332444011323220102 |
6 | 50213020321500120 |
7 | 3002561106633660 |
oct | 317651121212120 |
9 | 55510284223353 |
10 | 14281995523152 |
11 | 4606a62161a55 |
12 | 1727b434a1640 |
13 | 7c7a2b945656 |
14 | 37537633a1a0 |
15 | 19b792b1c36c |
hex | cfd49451450 |
14281995523152 has 80 divisors (see below), whose sum is σ = 42166416212352. Its totient is φ = 4080519375360.
The previous prime is 14281995523127. The next prime is 14281995523183. The reversal of 14281995523152 is 25132559918241.
It is a super-2 number, since 2×142819955231522 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14281995523092 and 14281995523101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32994202 + ... + 33424262.
Almost surely, 214281995523152 is an apocalyptic number.
14281995523152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14281995523152 is an abundant number, since it is smaller than the sum of its proper divisors (27884420689200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14281995523152 is a wasteful number, since it uses less digits than its factorization.
14281995523152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528916 (or 528910 counting only the distinct ones).
The product of its digits is 7776000, while the sum is 57.
The spelling of 14281995523152 in words is "fourteen trillion, two hundred eighty-one billion, nine hundred ninety-five million, five hundred twenty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •