Base | Representation |
---|---|
bin | 1100110110000000100011… |
… | …1011100100000101110111 |
3 | 1212000001100121210000021111 |
4 | 3031200020323210011313 |
5 | 3322333330042120203 |
6 | 50011320331455451 |
7 | 2655165244661101 |
oct | 315401073440567 |
9 | 55001317700244 |
10 | 14122002301303 |
11 | 4555120159376 |
12 | 1700b31bb7587 |
13 | 7b5911c0cc90 |
14 | 36b7196ac571 |
15 | 19752ba6d26d |
hex | cd808ee4177 |
14122002301303 has 4 divisors (see below), whose sum is σ = 15208310170648. Its totient is φ = 13035694431960.
The previous prime is 14122002301283. The next prime is 14122002301343. The reversal of 14122002301303 is 30310320022141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14122002301303 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 (14122002301343) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 543153934653 + ... + 543153934678.
It is an arithmetic number, because the mean of its divisors is an integer number (3802077542662).
Almost surely, 214122002301303 is an apocalyptic number.
14122002301303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14122002301303 is a deficient number, since it is larger than the sum of its proper divisors (1086307869345).
14122002301303 is a wasteful number, since it uses less digits than its factorization.
14122002301303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1086307869344.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 14122002301303 its reverse (30310320022141), we get a palindrome (44432322323444).
The spelling of 14122002301303 in words is "fourteen trillion, one hundred twenty-two billion, two million, three hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •