Base | Representation |
---|---|
bin | 10111101100011111… |
… | …01100011101101000 |
3 | 1012211120021011010111 |
4 | 23312033230131220 |
5 | 202023114302013 |
6 | 5502152224104 |
7 | 630146534644 |
oct | 136617543550 |
9 | 35746234114 |
10 | 12721244008 |
11 | 54388a0a00 |
12 | 257039b034 |
13 | 1279701625 |
14 | 889725c24 |
15 | 4e6c3c73d |
hex | 2f63ec768 |
12721244008 has 48 divisors (see below), whose sum is σ = 26277142500. Its totient is φ = 5769308160.
The previous prime is 12721243967. The next prime is 12721244009. The reversal of 12721244008 is 80044212721.
It can be written as a sum of positive squares in 2 ways, for example, as 12534593764 + 186650244 = 111958^2 + 13662^2 .
It is a super-2 number, since 2×127212440082 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12721244009) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 419998 + ... + 449266.
Almost surely, 212721244008 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 12721244008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13138571250).
12721244008 is an abundant number, since it is smaller than the sum of its proper divisors (13555898492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12721244008 is a wasteful number, since it uses less digits than its factorization.
12721244008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29746 (or 29731 counting only the distinct ones).
The product of its (nonzero) digits is 7168, while the sum is 31.
Adding to 12721244008 its reverse (80044212721), we get a palindrome (92765456729).
The spelling of 12721244008 in words is "twelve billion, seven hundred twenty-one million, two hundred forty-four thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.045 sec. • engine limits •