Base | Representation |
---|---|
bin | 11010111101101010… |
… | …10101000000010000 |
3 | 1101100212000221022121 |
4 | 31132311111000100 |
5 | 214121320033411 |
6 | 10352233344024 |
7 | 1021504313200 |
oct | 153665250020 |
9 | 41325027277 |
10 | 14475939856 |
11 | 6159321964 |
12 | 297bb68014 |
13 | 14990bb7b1 |
14 | 9b47a8400 |
15 | 59ace7571 |
hex | 35ed55010 |
14475939856 has 45 divisors (see below), whose sum is σ = 32633851869. Its totient is φ = 6202530432.
The previous prime is 14475939853. The next prime is 14475939871. The reversal of 14475939856 is 65893957441.
The square root of 14475939856 is 120316.
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., 7754563600 + 6721376256 = 88060^2 + 81984^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14475939794 and 14475939803.
It is not an unprimeable number, because it can be changed into a prime (14475939853) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3366700 + ... + 3370996.
Almost surely, 214475939856 is an apocalyptic number.
14475939856 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
14475939856 is the 120316-th square number.
It is an amenable number.
14475939856 is an abundant number, since it is smaller than the sum of its proper divisors (18157912013).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14475939856 is an frugal number, since it uses more digits than its factorization.
14475939856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8616 (or 4306 counting only the distinct ones).
The product of its digits is 32659200, while the sum is 61.
The spelling of 14475939856 in words is "fourteen billion, four hundred seventy-five million, nine hundred thirty-nine thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •