Base | Representation |
---|---|
bin | 1100111000111011001000… |
… | …1101011111011011011110 |
3 | 1212011211122002221211201102 |
4 | 3032032302031133123132 |
5 | 3324143413232144213 |
6 | 50050322240313102 |
7 | 2661620345550230 |
oct | 316166215373336 |
9 | 55154562854642 |
10 | 14172086990558 |
11 | 4574391705742 |
12 | 170a78b312792 |
13 | 7ba564392593 |
14 | 36dd0b366250 |
15 | 1989ada91158 |
hex | ce3b235f6de |
14172086990558 has 8 divisors (see below), whose sum is σ = 24295006269552. Its totient is φ = 6073751567376.
The previous prime is 14172086990557. The next prime is 14172086990597. The reversal of 14172086990558 is 85509968027141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×141720869905583 (a number of 40 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14172086990494 and 14172086990503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14172086990557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 506145963935 + ... + 506145963962.
It is an arithmetic number, because the mean of its divisors is an integer number (3036875783694).
Almost surely, 214172086990558 is an apocalyptic number.
14172086990558 is a deficient number, since it is larger than the sum of its proper divisors (10122919278994).
14172086990558 is a wasteful number, since it uses less digits than its factorization.
14172086990558 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012291927906.
The product of its (nonzero) digits is 43545600, while the sum is 65.
The spelling of 14172086990558 in words is "fourteen trillion, one hundred seventy-two billion, eighty-six million, nine hundred ninety thousand, five hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •