Base | Representation |
---|---|
bin | 1100110110100010100011… |
… | …1111100010110111010000 |
3 | 1212000220220202102210012210 |
4 | 3031220220333202313100 |
5 | 3323011023304302402 |
6 | 50015430201152120 |
7 | 2655640402263645 |
oct | 315505077426720 |
9 | 55026822383183 |
10 | 14131130150352 |
11 | 4558a84632476 |
12 | 170285aa8b640 |
13 | 7b67380049a7 |
14 | 36bd43a83dcc |
15 | 1978b30a106c |
hex | cda28fe2dd0 |
14131130150352 has 40 divisors (see below), whose sum is σ = 37492052520736. Its totient is φ = 4583069237376.
The previous prime is 14131130150341. The next prime is 14131130150353. The reversal of 14131130150352 is 25305103113141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14131130150353) 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 7 ways as a sum of consecutive naturals, for example, 3978356938 + ... + 3978360489.
Almost surely, 214131130150352 is an apocalyptic number.
14131130150352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14131130150352 is an abundant number, since it is smaller than the sum of its proper divisors (23360922370384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14131130150352 is a wasteful number, since it uses less digits than its factorization.
14131130150352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7956717475 (or 7956717469 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 14131130150352 its reverse (25305103113141), we get a palindrome (39436233263493).
The spelling of 14131130150352 in words is "fourteen trillion, one hundred thirty-one billion, one hundred thirty million, one hundred fifty thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •