Base | Representation |
---|---|
bin | 10000011110011100011… |
… | …000101101101001111000 |
3 | 11000020101222021111110220 |
4 | 100132130120231221320 |
5 | 122022221212414000 |
6 | 2224043041540040 |
7 | 144540655154112 |
oct | 20363430555170 |
9 | 4006358244426 |
10 | 1132200123000 |
11 | 3a71884a8aa1 |
12 | 163517644620 |
13 | 829c5c159ab |
14 | 3cb27bc23b2 |
15 | 1e6b781d1a0 |
hex | 1079c62da78 |
1132200123000 has 128 divisors (see below), whose sum is σ = 3535331641920. Its totient is φ = 301674969600.
The previous prime is 1132200122959. The next prime is 1132200123011. The reversal of 1132200123000 is 3210022311.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3558454 + ... + 3863546.
Almost surely, 21132200123000 is an apocalyptic number.
1132200123000 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 1132200123000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1767665820960).
1132200123000 is an abundant number, since it is smaller than the sum of its proper divisors (2403131518920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132200123000 is a wasteful number, since it uses less digits than its factorization.
1132200123000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306354 (or 306340 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1132200123000 its reverse (3210022311), we get a palindrome (1135410145311).
The spelling of 1132200123000 in words is "one trillion, one hundred thirty-two billion, two hundred million, one hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •