Base | Representation |
---|---|
bin | 1100110111001110111100… |
… | …0101100000011100001101 |
3 | 1212002001200000120111220110 |
4 | 3031303233011200130031 |
5 | 3323204423121133103 |
6 | 50025120254310233 |
7 | 2656541542350423 |
oct | 315635705403415 |
9 | 55061600514813 |
10 | 14143043536653 |
11 | 4563038405979 |
12 | 17050247b8379 |
13 | 7b78b62319b5 |
14 | 36c753d97113 |
15 | 197d5de13403 |
hex | cdcef16070d |
14143043536653 has 4 divisors (see below), whose sum is σ = 18857391382208. Its totient is φ = 9428695691100.
The previous prime is 14143043536649. The next prime is 14143043536679. The reversal of 14143043536653 is 35663534034141.
It is a happy number.
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 not a de Polignac number, because 14143043536653 - 22 = 14143043536649 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14143043536603) 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, 2357173922773 + ... + 2357173922778.
It is an arithmetic number, because the mean of its divisors is an integer number (4714347845552).
Almost surely, 214143043536653 is an apocalyptic number.
It is an amenable number.
14143043536653 is a deficient number, since it is larger than the sum of its proper divisors (4714347845555).
14143043536653 is an equidigital number, since it uses as much as digits as its factorization.
14143043536653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4714347845554.
The product of its (nonzero) digits is 4665600, while the sum is 48.
The spelling of 14143043536653 in words is "fourteen trillion, one hundred forty-three billion, forty-three million, five hundred thirty-six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •