Base | Representation |
---|---|
bin | 11011010111000100… |
… | …10011100010111110 |
3 | 1101220201001102000121 |
4 | 31223202103202332 |
5 | 220040344310313 |
6 | 10425325245154 |
7 | 1030002631642 |
oct | 155342234276 |
9 | 41821042017 |
10 | 14689056958 |
11 | 62586539a4 |
12 | 2a1b4037ba |
13 | 15012b93a4 |
14 | 9d4c02c22 |
15 | 5ae89328d |
hex | 36b8938be |
14689056958 has 8 divisors (see below), whose sum is σ = 23329678752. Its totient is φ = 6912497376.
The previous prime is 14689056929. The next prime is 14689056961. The reversal of 14689056958 is 85965098641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 14689056896 and 14689056905.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 216015510 + ... + 216015577.
It is an arithmetic number, because the mean of its divisors is an integer number (2916209844).
Almost surely, 214689056958 is an apocalyptic number.
14689056958 is a deficient number, since it is larger than the sum of its proper divisors (8640621794).
14689056958 is a wasteful number, since it uses less digits than its factorization.
14689056958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432031106.
The product of its (nonzero) digits is 18662400, while the sum is 61.
The spelling of 14689056958 in words is "fourteen billion, six hundred eighty-nine million, fifty-six thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •