Base | Representation |
---|---|
bin | 10000011110010010011… |
… | …011001101011010100100 |
3 | 11000012222022211000222111 |
4 | 100132102123031122210 |
5 | 122021400422131340 |
6 | 2224014312010404 |
7 | 144533555531215 |
oct | 20362233153244 |
9 | 4005868730874 |
10 | 1132033005220 |
11 | 3a7102134a27 |
12 | 16348b690a04 |
13 | 8299a402530 |
14 | 3cb0d91d40c |
15 | 1e6a7d0baea |
hex | 107926cd6a4 |
1132033005220 has 48 divisors (see below), whose sum is σ = 2560695076800. Its totient is φ = 417890169216.
The previous prime is 1132033005211. The next prime is 1132033005247. The reversal of 1132033005220 is 225003302311.
It is a junction number, because it is equal to n+sod(n) for n = 1132033005191 and 1132033005200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 723831 + ... + 1669729.
It is an arithmetic number, because the mean of its divisors is an integer number (53347814100).
Almost surely, 21132033005220 is an apocalyptic number.
1132033005220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1132033005220 is an abundant number, since it is smaller than the sum of its proper divisors (1428662071580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132033005220 is a wasteful number, since it uses less digits than its factorization.
1132033005220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 950524 (or 950522 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 1132033005220 its reverse (225003302311), we get a palindrome (1357036307531).
The spelling of 1132033005220 in words is "one trillion, one hundred thirty-two billion, thirty-three million, five thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.291 sec. • engine limits •