Base | Representation |
---|---|
bin | 1101000000100110110001… |
… | …1100111111011000001001 |
3 | 1212122110021120122121000221 |
4 | 3100021230130333120021 |
5 | 3333324204010302013 |
6 | 50231110021430041 |
7 | 3004301646166030 |
oct | 320115434773011 |
9 | 55573246577027 |
10 | 14304060634633 |
11 | 461535535a880 |
12 | 1730280b6b321 |
13 | 7c9b37114033 |
14 | 37646a9c9717 |
15 | 19c134d0d08d |
hex | d026c73f609 |
14304060634633 has 24 divisors (see below), whose sum is σ = 18944379440064. Its totient is φ = 10490372947200.
The previous prime is 14304060634547. The next prime is 14304060634637. The reversal of 14304060634633 is 33643606040341.
It is a happy number.
It is not a de Polignac number, because 14304060634633 - 213 = 14304060626441 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14304060634633.
It is not an unprimeable number, because it can be changed into a prime (14304060634637) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 321373978 + ... + 321418483.
It is an arithmetic number, because the mean of its divisors is an integer number (789349143336).
Almost surely, 214304060634633 is an apocalyptic number.
It is an amenable number.
14304060634633 is a deficient number, since it is larger than the sum of its proper divisors (4640318805431).
14304060634633 is a wasteful number, since it uses less digits than its factorization.
14304060634633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642792513 (or 642792496 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 43.
Adding to 14304060634633 its reverse (33643606040341), we get a palindrome (47947666674974).
The spelling of 14304060634633 in words is "fourteen trillion, three hundred four billion, sixty million, six hundred thirty-four thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •