Base | Representation |
---|---|
bin | 1101000000111101010111… |
… | …1011010010001110011100 |
3 | 1212200000221020002221201010 |
4 | 3100033111323102032130 |
5 | 3333424114014314012 |
6 | 50233551501215220 |
7 | 3004605145552116 |
oct | 320172573221634 |
9 | 55600836087633 |
10 | 14310125151132 |
11 | 4617987646888 |
12 | 1731493b61510 |
13 | 7ca59267b735 |
14 | 3768841d03b6 |
15 | 19c38c43bc3c |
hex | d03d5ed239c |
14310125151132 has 48 divisors (see below), whose sum is σ = 33416247603200. Its totient is φ = 4766335202880.
The previous prime is 14310125151109. The next prime is 14310125151143. The reversal of 14310125151132 is 23115152101341.
It is a self number, because there is not a number n which added to its sum of digits gives 14310125151132.
It is a congruent number.
It is an unprimeable number.
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, 82640082 + ... + 82813062.
Almost surely, 214310125151132 is an apocalyptic number.
14310125151132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14310125151132 is an abundant number, since it is smaller than the sum of its proper divisors (19106122452068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14310125151132 is a wasteful number, since it uses less digits than its factorization.
14310125151132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178306 (or 178304 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 14310125151132 its reverse (23115152101341), we get a palindrome (37425277252473).
The spelling of 14310125151132 in words is "fourteen trillion, three hundred ten billion, one hundred twenty-five million, one hundred fifty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •