Base | Representation |
---|---|
bin | 1101011011101111010000… |
… | …1011110100111100000000 |
3 | 1221022000110020101111101221 |
4 | 3112323310023310330000 |
5 | 3413443324220223033 |
6 | 51225200020004424 |
7 | 3053053120051000 |
oct | 326736413647400 |
9 | 57260406344357 |
10 | 14770194304768 |
11 | 4785005699401 |
12 | 17a6690230714 |
13 | 831a91b7a466 |
14 | 390c4a0c8000 |
15 | 1a931769812d |
hex | d6ef42f4f00 |
14770194304768 has 576 divisors, whose sum is σ = 38304887040000. Its totient is φ = 5653812412416.
The previous prime is 14770194304759. The next prime is 14770194304781. The reversal of 14770194304768 is 86740349107741.
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 63 ways as a sum of consecutive naturals, for example, 2554068405 + ... + 2554074187.
It is an arithmetic number, because the mean of its divisors is an integer number (66501540000).
Almost surely, 214770194304768 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 14770194304768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19152443520000).
14770194304768 is an abundant number, since it is smaller than the sum of its proper divisors (23534692735232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14770194304768 is an equidigital number, since it uses as much as digits as its factorization.
14770194304768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5925 (or 5897 counting only the distinct ones).
The product of its (nonzero) digits is 28449792, while the sum is 61.
The spelling of 14770194304768 in words is "fourteen trillion, seven hundred seventy billion, one hundred ninety-four million, three hundred four thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •