Base | Representation |
---|---|
bin | 11000100100111001… |
… | …10100010101000011 |
3 | 1021001112200022102122 |
4 | 30102130310111003 |
5 | 204010234234042 |
6 | 10021134434455 |
7 | 644653641011 |
oct | 142234642503 |
9 | 37045608378 |
10 | 13194446147 |
11 | 5660a14753 |
12 | 2682962a2b |
13 | 13237630ac |
14 | 8d25038b1 |
15 | 5235607d2 |
hex | 312734543 |
13194446147 has 16 divisors (see below), whose sum is σ = 14120517600. Its totient is φ = 12328961952.
The previous prime is 13194446143. The next prime is 13194446183. The reversal of 13194446147 is 74164449131.
The cubic root of 13194446147 is 2363.
It is a perfect power (a cube), and thus also a powerful number.
It is not a de Polignac number, because 13194446147 - 22 = 13194446143 is a prime.
It is a super-3 number, since 3×131944461473 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13194446098 and 13194446107.
It is not an unprimeable number, because it can be changed into a prime (13194446141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94924004 + ... + 94924142.
It is an arithmetic number, because the mean of its divisors is an integer number (882532350).
Almost surely, 213194446147 is an apocalyptic number.
13194446147 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
13194446147 is a deficient number, since it is larger than the sum of its proper divisors (926071453).
13194446147 is an frugal number, since it uses more digits than its factorization.
13194446147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468 (or 156 counting only the distinct ones).
The product of its digits is 290304, while the sum is 44.
The spelling of 13194446147 in words is "thirteen billion, one hundred ninety-four million, four hundred forty-six thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •