Base | Representation |
---|---|
bin | 1100111000111100010101… |
… | …0000101101000000000000 |
3 | 1212011212110101100200000022 |
4 | 3032033011100231000000 |
5 | 3324200042042142210 |
6 | 50050414054513012 |
7 | 2661631306310240 |
oct | 316170520550000 |
9 | 55155411320008 |
10 | 14172406599680 |
11 | 457453606280a |
12 | 170a85a365768 |
13 | 7ba5b56678c4 |
14 | 36dd3b9a1b20 |
15 | 1989cbb75155 |
hex | ce3c542d000 |
14172406599680 has 208 divisors, whose sum is σ = 39400610836224. Its totient is φ = 4792544133120.
The previous prime is 14172406599677. The next prime is 14172406599707. The reversal of 14172406599680 is 8699560427141.
It is a super-2 number, since 2×141724065996802 (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 15 ways as a sum of consecutive naturals, for example, 9788165 + ... + 11142395.
Almost surely, 214172406599680 is an apocalyptic number.
14172406599680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14172406599680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19700305418112).
14172406599680 is an abundant number, since it is smaller than the sum of its proper divisors (25228204236544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14172406599680 is an equidigital number, since it uses as much as digits as its factorization.
14172406599680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1354340 (or 1354318 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 62.
The spelling of 14172406599680 in words is "fourteen trillion, one hundred seventy-two billion, four hundred six million, five hundred ninety-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •