Base | Representation |
---|---|
bin | 11010001100011101… |
… | …00001011000010000 |
3 | 1100022002020012100121 |
4 | 31012032201120100 |
5 | 212300124114434 |
6 | 10243245200024 |
7 | 1005332331421 |
oct | 150616413020 |
9 | 40262205317 |
10 | 14063113744 |
11 | 5a67296559 |
12 | 2885860014 |
13 | 14317091a4 |
14 | 975a25648 |
15 | 57494d7b4 |
hex | 3463a1610 |
14063113744 has 45 divisors (see below), whose sum is σ = 28505568973. Its totient is φ = 6720619136.
The previous prime is 14063113639. The next prime is 14063113769. The reversal of 14063113744 is 44731136041.
The square root of 14063113744 is 118588.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 11408803344 + 2654310400 = 106812^2 + 51520^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 10909452 + ... + 10910740.
Almost surely, 214063113744 is an apocalyptic number.
14063113744 is the 118588-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14063113744
14063113744 is an abundant number, since it is smaller than the sum of its proper divisors (14442455229).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14063113744 is an frugal number, since it uses more digits than its factorization.
14063113744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2632 (or 1314 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 34.
Adding to 14063113744 its reverse (44731136041), we get a palindrome (58794249785).
The spelling of 14063113744 in words is "fourteen billion, sixty-three million, one hundred thirteen thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •