Base | Representation |
---|---|
bin | 11001110001100010… |
… | …00111010100011000 |
3 | 1022201100022201112020 |
4 | 30320301013110120 |
5 | 211314322113031 |
6 | 10205021214440 |
7 | 666621055320 |
oct | 147061072430 |
9 | 38640281466 |
10 | 13837301016 |
11 | 5960883070 |
12 | 2822101420 |
13 | 13c69b4aa6 |
14 | 953a44280 |
15 | 55ebe6096 |
hex | 338c47518 |
13837301016 has 128 divisors (see below), whose sum is σ = 43161845760. Its totient is φ = 3591388800.
The previous prime is 13837300937. The next prime is 13837301017. The reversal of 13837301016 is 61010373831.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13837301017) 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, 3899355 + ... + 3902901.
It is an arithmetic number, because the mean of its divisors is an integer number (337201920).
Almost surely, 213837301016 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 13837301016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21580922880).
13837301016 is an abundant number, since it is smaller than the sum of its proper divisors (29324544744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13837301016 is a wasteful number, since it uses less digits than its factorization.
13837301016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5685 (or 5681 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
Adding to 13837301016 its reverse (61010373831), we get a palindrome (74847674847).
The spelling of 13837301016 in words is "thirteen billion, eight hundred thirty-seven million, three hundred one thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •