Base | Representation |
---|---|
bin | 1110111110001001101001… |
… | …1110000101001100101011 |
3 | 2011021122110212012111211002 |
4 | 3233202122132011030223 |
5 | 4124143414000131042 |
6 | 55002011432425215 |
7 | 3316155413364464 |
oct | 357423236051453 |
9 | 64248425174732 |
10 | 16460906255147 |
11 | 527703849a822 |
12 | 1a1a29824820b |
13 | 92534525a383 |
14 | 40c9d807bd6b |
15 | 1d82bc88c132 |
hex | ef89a78532b |
16460906255147 has 8 divisors (see below), whose sum is σ = 17329895616000. Its totient is φ = 15592179481704.
The previous prime is 16460906255141. The next prime is 16460906255159. The reversal of 16460906255147 is 74155260906461.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16460906255147 - 224 = 16460889477931 is a prime.
It is a super-2 number, since 2×164609062551472 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16460906255092 and 16460906255101.
It is not an unprimeable number, because it can be changed into a prime (16460906255141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65518163 + ... + 65768924.
It is an arithmetic number, because the mean of its divisors is an integer number (2166236952000).
Almost surely, 216460906255147 is an apocalyptic number.
16460906255147 is a deficient number, since it is larger than the sum of its proper divisors (868989360853).
16460906255147 is a wasteful number, since it uses less digits than its factorization.
16460906255147 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131293705.
The product of its (nonzero) digits is 10886400, while the sum is 56.
The spelling of 16460906255147 in words is "sixteen trillion, four hundred sixty billion, nine hundred six million, two hundred fifty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •