Base | Representation |
---|---|
bin | 11001100001110001… |
… | …01111000101000000 |
3 | 1022101010112020222020 |
4 | 30300320233011000 |
5 | 211032000044102 |
6 | 10143535241440 |
7 | 663424160550 |
oct | 146070570500 |
9 | 38333466866 |
10 | 13705081152 |
11 | 58a3185354 |
12 | 27a5979280 |
13 | 13a549ca99 |
14 | 940267160 |
15 | 5532c9bbc |
hex | 330e2f140 |
13705081152 has 448 divisors, whose sum is σ = 44832227328. Its totient is φ = 3612672000.
The previous prime is 13705081151. The next prime is 13705081213. The reversal of 13705081152 is 25118050731.
It is a tau number, because it is divible by the number of its divisors (448).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13705081151) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 121283848 + ... + 121283960.
It is an arithmetic number, because the mean of its divisors is an integer number (100071936).
Almost surely, 213705081152 is an apocalyptic number.
13705081152 is a gapful number since it is divisible by the number (12) 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 13705081152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22416113664).
13705081152 is an abundant number, since it is smaller than the sum of its proper divisors (31127146176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13705081152 is a wasteful number, since it uses less digits than its factorization.
13705081152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278 (or 268 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 33.
The spelling of 13705081152 in words is "thirteen billion, seven hundred five million, eighty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •