Base | Representation |
---|---|
bin | 11010101010100011… |
… | …000011110100110000 |
3 | 2201220100111122200022 |
4 | 122222203003310300 |
5 | 432114031334300 |
6 | 21053012143012 |
7 | 2032335341363 |
oct | 325243036460 |
9 | 81810448608 |
10 | 28631121200 |
11 | 11162581140 |
12 | 5670607a68 |
13 | 29138c1a46 |
14 | 15587180da |
15 | b28880285 |
hex | 6aa8c3d30 |
28631121200 has 120 divisors (see below), whose sum is σ = 79453865520. Its totient is φ = 9798860800.
The previous prime is 28631121193. The next prime is 28631121203. The reversal of 28631121200 is 212113682.
It is a super-2 number, since 2×286311212002 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 28631121200.
It is not an unprimeable number, because it can be changed into a prime (28631121203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 116585 + ... + 266184.
It is an arithmetic number, because the mean of its divisors is an integer number (662115546).
Almost surely, 228631121200 is an apocalyptic number.
28631121200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
28631121200 is an abundant number, since it is smaller than the sum of its proper divisors (50822744320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28631121200 is a wasteful number, since it uses less digits than its factorization.
28631121200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 382815 (or 382804 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 28631121200 its reverse (212113682), we get a palindrome (28843234882).
The spelling of 28631121200 in words is "twenty-eight billion, six hundred thirty-one million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.477 sec. • engine limits •