Base | Representation |
---|---|
bin | 1100110101011101010111… |
… | …0010101011101100010011 |
3 | 1211222010222011212220220200 |
4 | 3031113111302223230103 |
5 | 3322210002411304111 |
6 | 50003115030310243 |
7 | 2654412153102636 |
oct | 315272562535423 |
9 | 54863864786820 |
10 | 14112554400531 |
11 | 4551112055714 |
12 | 16bb135ab8383 |
13 | 7b4a67719652 |
14 | 36b0a09c3c1d |
15 | 1971773ba256 |
hex | cd5d5cabb13 |
14112554400531 has 12 divisors (see below), whose sum is σ = 20387508403080. Its totient is φ = 9407119937760.
The previous prime is 14112554400517. The next prime is 14112554400563. The reversal of 14112554400531 is 13500445521141.
14112554400531 is a `hidden beast` number, since 1 + 4 + 1 + 12 + 554 + 40 + 0 + 53 + 1 = 666.
It is not a de Polignac number, because 14112554400531 - 25 = 14112554400499 is a prime.
It is a super-2 number, since 2×141125544005312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14112504400531) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 104067025 + ... + 104202546.
It is an arithmetic number, because the mean of its divisors is an integer number (1698959033590).
Almost surely, 214112554400531 is an apocalyptic number.
14112554400531 is a deficient number, since it is larger than the sum of its proper divisors (6274954002549).
14112554400531 is a wasteful number, since it uses less digits than its factorization.
14112554400531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208277106 (or 208277103 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 36.
Adding to 14112554400531 its reverse (13500445521141), we get a palindrome (27612999921672).
The spelling of 14112554400531 in words is "fourteen trillion, one hundred twelve billion, five hundred fifty-four million, four hundred thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •