Base | Representation |
---|---|
bin | 11001110010011011… |
… | …00110111101000000 |
3 | 1022201212101012220101 |
4 | 30321031212331000 |
5 | 211323230124444 |
6 | 10205445252144 |
7 | 1000041415516 |
oct | 147115467500 |
9 | 38655335811 |
10 | 13844770624 |
11 | 59650150a3 |
12 | 2824704054 |
13 | 13c83cb989 |
14 | 954a2a4b6 |
15 | 5606be3d4 |
hex | 339366f40 |
13844770624 has 112 divisors (see below), whose sum is σ = 30121652736. Its totient is φ = 6285312000.
The previous prime is 13844770613. The next prime is 13844770649. The reversal of 13844770624 is 42607744831.
13844770624 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20270187 + ... + 20270869.
It is an arithmetic number, because the mean of its divisors is an integer number (268943328).
Almost surely, 213844770624 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 13844770624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15060826368).
13844770624 is an abundant number, since it is smaller than the sum of its proper divisors (16276882112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13844770624 is a wasteful number, since it uses less digits than its factorization.
13844770624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1344 (or 1334 counting only the distinct ones).
The product of its (nonzero) digits is 903168, while the sum is 46.
The spelling of 13844770624 in words is "thirteen billion, eight hundred forty-four million, seven hundred seventy thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •