Base | Representation |
---|---|
bin | 11001101000011110… |
… | …00010011000000000 |
3 | 1022112001020101111120 |
4 | 30310033002120000 |
5 | 211140340242013 |
6 | 10153303312240 |
7 | 665005525440 |
oct | 146417023000 |
9 | 38461211446 |
10 | 13761259008 |
11 | 5921965632 |
12 | 280074b680 |
13 | 13b400c113 |
14 | 9478cc120 |
15 | 5581c5123 |
hex | 3343c2600 |
13761259008 has 320 divisors, whose sum is σ = 44971407360. Its totient is φ = 3649830912.
The previous prime is 13761258937. The next prime is 13761259009. The reversal of 13761259008 is 80095216731.
It is a super-2 number, since 2×137612590082 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13761259009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14439460 + ... + 14440412.
It is an arithmetic number, because the mean of its divisors is an integer number (140535648).
Almost surely, 213761259008 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 13761259008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22485703680).
13761259008 is an abundant number, since it is smaller than the sum of its proper divisors (31210148352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13761259008 is an equidigital number, since it uses as much as digits as its factorization.
13761259008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1077 (or 1061 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 42.
The spelling of 13761259008 in words is "thirteen billion, seven hundred sixty-one million, two hundred fifty-nine thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •