Base | Representation |
---|---|
bin | 1100110101011101001101… |
… | …0001001000011101001111 |
3 | 1211222010212020012100022101 |
4 | 3031113103101020131033 |
5 | 3322204411041113043 |
6 | 50003110514455531 |
7 | 2654411130120661 |
oct | 315272321103517 |
9 | 54863766170271 |
10 | 14112512051023 |
11 | 45510a015a921 |
12 | 16bb1238945a7 |
13 | 7b4a5ba0c579 |
14 | 36b09911c531 |
15 | 19717380224d |
hex | cd5d344874f |
14112512051023 has 16 divisors (see below), whose sum is σ = 14774200731360. Its totient is φ = 13462960896000.
The previous prime is 14112512051009. The next prime is 14112512051039. The reversal of 14112512051023 is 32015021521141.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14112512051023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14112512050982 and 14112512051000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14112512051093) 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 15 ways as a sum of consecutive naturals, for example, 2483173 + ... + 5864398.
It is an arithmetic number, because the mean of its divisors is an integer number (923387545710).
Almost surely, 214112512051023 is an apocalyptic number.
14112512051023 is a deficient number, since it is larger than the sum of its proper divisors (661688680337).
14112512051023 is an equidigital number, since it uses as much as digits as its factorization.
14112512051023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8348298.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 14112512051023 its reverse (32015021521141), we get a palindrome (46127533572164).
The spelling of 14112512051023 in words is "fourteen trillion, one hundred twelve billion, five hundred twelve million, fifty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •