Base | Representation |
---|---|
bin | 11011101111111100… |
… | …00101110001000000 |
3 | 1102110020120220101111 |
4 | 31313332011301000 |
5 | 221002300322021 |
6 | 10502140413104 |
7 | 1035115036612 |
oct | 156776056100 |
9 | 42406526344 |
10 | 14897667136 |
11 | 6355387900 |
12 | 2a79247194 |
13 | 1535599771 |
14 | a147c6db2 |
15 | 5c2d4d8e1 |
hex | 377f85c40 |
14897667136 has 189 divisors, whose sum is σ = 34770849813. Its totient is φ = 6327383040.
The previous prime is 14897667133. The next prime is 14897667149. The reversal of 14897667136 is 63176679841.
The square root of 14897667136 is 122056.
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., 8456641600 + 6441025536 = 91960^2 + 80256^2 .
It is not an unprimeable number, because it can be changed into a prime (14897667131) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 204077596 + ... + 204077668.
Almost surely, 214897667136 is an apocalyptic number.
14897667136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
14897667136 is the 122056-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14897667136
14897667136 is an abundant number, since it is smaller than the sum of its proper divisors (19873182677).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14897667136 is an equidigital number, since it uses as much as digits as its factorization.
14897667136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 218 (or 105 counting only the distinct ones).
The product of its digits is 9144576, while the sum is 58.
The spelling of 14897667136 in words is "fourteen billion, eight hundred ninety-seven million, six hundred sixty-seven thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •