Base | Representation |
---|---|
bin | 1101000001100011110100… |
… | …0000011000000100011111 |
3 | 1212201000120101201211221201 |
4 | 3100120331000120010133 |
5 | 3334111232241124011 |
6 | 50242415452140331 |
7 | 3005421651421342 |
oct | 320307500300437 |
9 | 55630511654851 |
10 | 14320444473631 |
11 | 46212a263258a |
12 | 1733493a676a7 |
13 | 7cb54857091a |
14 | 377182916459 |
15 | 19c793373cc1 |
hex | d063d01811f |
14320444473631 has 2 divisors, whose sum is σ = 14320444473632. Its totient is φ = 14320444473630.
The previous prime is 14320444473619. The next prime is 14320444473677. The reversal of 14320444473631 is 13637444402341.
It is an a-pointer prime, because the next prime (14320444473677) can be obtained adding 14320444473631 to its sum of digits (46).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14320444473631 - 29 = 14320444473119 is a prime.
It is a super-2 number, since 2×143204444736312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14320444473691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7160222236815 + 7160222236816.
It is an arithmetic number, because the mean of its divisors is an integer number (7160222236816).
Almost surely, 214320444473631 is an apocalyptic number.
14320444473631 is a deficient number, since it is larger than the sum of its proper divisors (1).
14320444473631 is an equidigital number, since it uses as much as digits as its factorization.
14320444473631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2322432, while the sum is 46.
Adding to 14320444473631 its reverse (13637444402341), we get a palindrome (27957888875972).
The spelling of 14320444473631 in words is "fourteen trillion, three hundred twenty billion, four hundred forty-four million, four hundred seventy-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •