Base | Representation |
---|---|
bin | 1101000001111100010001… |
… | …1010110111101110001001 |
3 | 1212201122112001101201121001 |
4 | 3100133010122313232021 |
5 | 3334213204343413343 |
6 | 50245423234215001 |
7 | 3006043460544301 |
oct | 320370432675611 |
9 | 55648461351531 |
10 | 14327011310473 |
11 | 4624062420274 |
12 | 1734807124461 |
13 | 7cc053bc35b4 |
14 | 377606b18601 |
15 | 19ca29b2844d |
hex | d07c46b7b89 |
14327011310473 has 4 divisors (see below), whose sum is σ = 15081064537360. Its totient is φ = 13572958083588.
The previous prime is 14327011310471. The next prime is 14327011310477. The reversal of 14327011310473 is 37401311072341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14327011310473 - 21 = 14327011310471 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14327011310471) 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 3 ways as a sum of consecutive naturals, for example, 377026613415 + ... + 377026613452.
It is an arithmetic number, because the mean of its divisors is an integer number (3770266134340).
Almost surely, 214327011310473 is an apocalyptic number.
It is an amenable number.
14327011310473 is a deficient number, since it is larger than the sum of its proper divisors (754053226887).
14327011310473 is an equidigital number, since it uses as much as digits as its factorization.
14327011310473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754053226886.
The product of its (nonzero) digits is 42336, while the sum is 37.
The spelling of 14327011310473 in words is "fourteen trillion, three hundred twenty-seven billion, eleven million, three hundred ten thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •