Base | Representation |
---|---|
bin | 10000011110010000100… |
… | …010010111000010010000 |
3 | 11000012220010012112011102 |
4 | 100132100202113002100 |
5 | 122021314314401300 |
6 | 2224011221003532 |
7 | 144533022334514 |
oct | 20362042270220 |
9 | 4005803175142 |
10 | 1132001325200 |
11 | 3a7096267299 |
12 | 163480b535a8 |
13 | 8299398c965 |
14 | 3cb09634144 |
15 | 1e6a51500d5 |
hex | 10790897090 |
1132001325200 has 30 divisors (see below), whose sum is σ = 2719633184754. Its totient is φ = 452800529920.
The previous prime is 1132001325173. The next prime is 1132001325209. The reversal of 1132001325200 is 25231002311.
It can be written as a sum of positive squares in 3 ways, for example, as 215218055056 + 916783270144 = 463916^2 + 957488^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (1132001325209) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1415001257 + ... + 1415002056.
Almost surely, 21132001325200 is an apocalyptic number.
1132001325200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1132001325200 is an abundant number, since it is smaller than the sum of its proper divisors (1587631859554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132001325200 is a wasteful number, since it uses less digits than its factorization.
1132001325200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2830003331 (or 2830003320 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 1132001325200 its reverse (25231002311), we get a palindrome (1157232327511).
The spelling of 1132001325200 in words is "one trillion, one hundred thirty-two billion, one million, three hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •