Base | Representation |
---|---|
bin | 1000000001000011010… |
… | …0111010110000101100 |
3 | 111011111000211221122011 |
4 | 2000100310322300230 |
5 | 4224023120323400 |
6 | 143133540331004 |
7 | 12643601255443 |
oct | 2002064726054 |
9 | 434430757564 |
10 | 137721261100 |
11 | 53453074955 |
12 | 228366a3a64 |
13 | ccaa752297 |
14 | 6946b35d5a |
15 | 38b0b4e8ba |
hex | 2010d3ac2c |
137721261100 has 72 divisors (see below), whose sum is σ = 302692813920. Its totient is φ = 54383070720.
The previous prime is 137721261089. The next prime is 137721261131. The reversal of 137721261100 is 1162127731.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5746342 + ... + 5770258.
It is an arithmetic number, because the mean of its divisors is an integer number (4204066860).
Almost surely, 2137721261100 is an apocalyptic number.
137721261100 is a gapful number since it is divisible by the number (10) 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 137721261100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151346406960).
137721261100 is an abundant number, since it is smaller than the sum of its proper divisors (164971552820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137721261100 is a wasteful number, since it uses less digits than its factorization.
137721261100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24667 (or 24660 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 31.
Adding to 137721261100 its reverse (1162127731), we get a palindrome (138883388831).
The spelling of 137721261100 in words is "one hundred thirty-seven billion, seven hundred twenty-one million, two hundred sixty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •