Base | Representation |
---|---|
bin | 1100110010010010010110… |
… | …1001000001101101011100 |
3 | 1211202221022100001201010112 |
4 | 3030210211221001231130 |
5 | 3320311401211043313 |
6 | 45522103335025152 |
7 | 2650442550620300 |
oct | 314444551015534 |
9 | 54687270051115 |
10 | 14058059471708 |
11 | 452aa9809605a |
12 | 16b066780b1b8 |
13 | 7ac89165a435 |
14 | 3685b1307d00 |
15 | 195a380d98a8 |
hex | cc925a41b5c |
14058059471708 has 72 divisors (see below), whose sum is σ = 30142828432080. Its totient is φ = 5704294337280.
The previous prime is 14058059471671. The next prime is 14058059471711. The reversal of 14058059471708 is 80717495085041.
It is a happy number.
It is a super-2 number, since 2×140580594717082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4943168 + ... + 7249208.
It is an arithmetic number, because the mean of its divisors is an integer number (418650394890).
Almost surely, 214058059471708 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14058059471708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15071414216040).
14058059471708 is an abundant number, since it is smaller than the sum of its proper divisors (16084768960372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14058059471708 is a wasteful number, since it uses less digits than its factorization.
14058059471708 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2307715 (or 2307706 counting only the distinct ones).
The product of its (nonzero) digits is 11289600, while the sum is 59.
The spelling of 14058059471708 in words is "fourteen trillion, fifty-eight billion, fifty-nine million, four hundred seventy-one thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •