Base | Representation |
---|---|
bin | 1110111101101100010101… |
… | …0001000010010110010111 |
3 | 2011020220011020202211122202 |
4 | 3233123011101002112113 |
5 | 4124031303241240203 |
6 | 54554230345515115 |
7 | 3315456346142156 |
oct | 357330521022627 |
9 | 64226136684582 |
10 | 16453034321303 |
11 | 5273768a43378 |
12 | 1a1885baa2a9b |
13 | 92468c406758 |
14 | 40c48c7cd59d |
15 | 1d7eab73c388 |
hex | ef6c5442597 |
16453034321303 has 4 divisors (see below), whose sum is σ = 16453293035688. Its totient is φ = 16452775606920.
The previous prime is 16453034321299. The next prime is 16453034321351. The reversal of 16453034321303 is 30312343035461.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 16453034321303 - 22 = 16453034321299 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 (16453034324303) 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, 129261776 + ... + 129388997.
It is an arithmetic number, because the mean of its divisors is an integer number (4113323258922).
Almost surely, 216453034321303 is an apocalyptic number.
16453034321303 is a deficient number, since it is larger than the sum of its proper divisors (258714385).
16453034321303 is an equidigital number, since it uses as much as digits as its factorization.
16453034321303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258714384.
The product of its (nonzero) digits is 233280, while the sum is 38.
Adding to 16453034321303 its reverse (30312343035461), we get a palindrome (46765377356764).
The spelling of 16453034321303 in words is "sixteen trillion, four hundred fifty-three billion, thirty-four million, three hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •