Base | Representation |
---|---|
bin | 1101010001000011010101… |
… | …0001001010001111010000 |
3 | 1220122110120102020222221120 |
4 | 3110100311101022033100 |
5 | 3402441330233044143 |
6 | 51004554233122240 |
7 | 3033563416413123 |
oct | 324206521121720 |
9 | 56573512228846 |
10 | 14586602628048 |
11 | 4714163a03360 |
12 | 1776b93859380 |
13 | 81a6840ab419 |
14 | 385dd12a83ba |
15 | 1a466e9c4383 |
hex | d443544a3d0 |
14586602628048 has 160 divisors (see below), whose sum is σ = 43304407626240. Its totient is φ = 4184333729280.
The previous prime is 14586602627969. The next prime is 14586602628071. The reversal of 14586602628048 is 84082620668541.
It is a junction number, because it is equal to n+sod(n) for n = 14586602627982 and 14586602628000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12555586 + ... + 13668062.
It is an arithmetic number, because the mean of its divisors is an integer number (270652547664).
Almost surely, 214586602628048 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 14586602628048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21652203813120).
14586602628048 is an abundant number, since it is smaller than the sum of its proper divisors (28717804998192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14586602628048 is a wasteful number, since it uses less digits than its factorization.
14586602628048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1113825 (or 1113819 counting only the distinct ones).
The product of its (nonzero) digits is 35389440, while the sum is 60.
The spelling of 14586602628048 in words is "fourteen trillion, five hundred eighty-six billion, six hundred two million, six hundred twenty-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •