Base | Representation |
---|---|
bin | 1101011010000100001111… |
… | …1101101100100101011100 |
3 | 1221012021022020210100200020 |
4 | 3112201003331230211130 |
5 | 3413011011302203443 |
6 | 51204045323432140 |
7 | 3051015214413000 |
oct | 326410375544534 |
9 | 57167266710606 |
10 | 14741468006748 |
11 | 477390442053a |
12 | 17a0bb3985650 |
13 | 82c164643392 |
14 | 38d6c2cb6700 |
15 | 1a86d57b7583 |
hex | d6843f6c95c |
14741468006748 has 48 divisors (see below), whose sum is σ = 40112838124800. Its totient is φ = 4211848000752.
The previous prime is 14741468006729. The next prime is 14741468006809. The reversal of 14741468006748 is 84760086414741.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 14741468006691 and 14741468006700.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1790747586 + ... + 1790755817.
It is an arithmetic number, because the mean of its divisors is an integer number (835684127600).
Almost surely, 214741468006748 is an apocalyptic number.
It is an amenable number.
14741468006748 is an abundant number, since it is smaller than the sum of its proper divisors (25371370118052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14741468006748 is a wasteful number, since it uses less digits than its factorization.
14741468006748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3581503431 (or 3581503415 counting only the distinct ones).
The product of its (nonzero) digits is 28901376, while the sum is 60.
The spelling of 14741468006748 in words is "fourteen trillion, seven hundred forty-one billion, four hundred sixty-eight million, six thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •