Base | Representation |
---|---|
bin | 1101000000101000110011… |
… | …1000010000010111110010 |
3 | 1212122111200111022120222220 |
4 | 3100022030320100113302 |
5 | 3333331312242344132 |
6 | 50231240013541510 |
7 | 3004321303235364 |
oct | 320121470202762 |
9 | 55574614276886 |
10 | 14304604653042 |
11 | 4615604451970 |
12 | 17303b31a4896 |
13 | 7c9bc2a3ba12 |
14 | 3764bcd5cd34 |
15 | 19c16796da2c |
hex | d028ce105f2 |
14304604653042 has 128 divisors (see below), whose sum is σ = 31953108096000. Its totient is φ = 4233390803840.
The previous prime is 14304604653041. The next prime is 14304604653091. The reversal of 14304604653042 is 24035640640341.
It is a junction number, because it is equal to n+sod(n) for n = 14304604652985 and 14304604653003.
It is not an unprimeable number, because it can be changed into a prime (14304604653041) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3358674709 + ... + 3358678967.
It is an arithmetic number, because the mean of its divisors is an integer number (249633657000).
Almost surely, 214304604653042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14304604653042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15976554048000).
14304604653042 is an abundant number, since it is smaller than the sum of its proper divisors (17648503442958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14304604653042 is an frugal number, since it uses more digits than its factorization.
14304604653042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4613 (or 4447 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 42.
The spelling of 14304604653042 in words is "fourteen trillion, three hundred four billion, six hundred four million, six hundred fifty-three thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •