Base | Representation |
---|---|
bin | 1100011000011101001100… |
… | …1110110011110111100000 |
3 | 1210012111212122100211002021 |
4 | 3012013103032303313200 |
5 | 3241024034040023224 |
6 | 44542153151231224 |
7 | 2603412633063445 |
oct | 306072316636740 |
9 | 53174778324067 |
10 | 13614295236064 |
11 | 4379876811776 |
12 | 163a65bb18514 |
13 | 779a90145093 |
14 | 350d14a759cc |
15 | 1892145051e4 |
hex | c61d33b3de0 |
13614295236064 has 96 divisors (see below), whose sum is σ = 27846485583840. Its totient is φ = 6544204800000.
The previous prime is 13614295236043. The next prime is 13614295236173. The reversal of 13614295236064 is 46063259241631.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 978523572 + ... + 978537484.
It is an arithmetic number, because the mean of its divisors is an integer number (290067558165).
Almost surely, 213614295236064 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 13614295236064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13923242791920).
13614295236064 is an abundant number, since it is smaller than the sum of its proper divisors (14232190347776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13614295236064 is a wasteful number, since it uses less digits than its factorization.
13614295236064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18404 (or 18396 counting only the distinct ones).
The product of its (nonzero) digits is 5598720, while the sum is 52.
The spelling of 13614295236064 in words is "thirteen trillion, six hundred fourteen billion, two hundred ninety-five million, two hundred thirty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •