Base | Representation |
---|---|
bin | 10010100000101001001… |
… | …111011010110000000000 |
3 | 11111121021000121020020000 |
4 | 102200221033122300000 |
5 | 131320030032232300 |
6 | 2412203314120000 |
7 | 160620254351535 |
oct | 22405117326000 |
9 | 4447230536200 |
10 | 1272002227200 |
11 | 4504a9107091 |
12 | 186632b80000 |
13 | 92c457a9383 |
14 | 457cb018d8c |
15 | 2314ae9dc00 |
hex | 128293dac00 |
1272002227200 has 330 divisors, whose sum is σ = 4710082372116. Its totient is φ = 339200040960.
The previous prime is 1272002227193. The next prime is 1272002227267. The reversal of 1272002227200 is 27222002721.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 1766887 + ... + 2380313.
Almost surely, 21272002227200 is an apocalyptic number.
1272002227200 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 1272002227200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2355041186058).
1272002227200 is an abundant number, since it is smaller than the sum of its proper divisors (3438080144916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1272002227200 is an equidigital number, since it uses as much as digits as its factorization.
1272002227200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613469 (or 613437 counting only the distinct ones).
The product of its (nonzero) digits is 3136, while the sum is 27.
Adding to 1272002227200 its reverse (27222002721), we get a palindrome (1299224229921).
The spelling of 1272002227200 in words is "one trillion, two hundred seventy-two billion, two million, two hundred twenty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •