Base | Representation |
---|---|
bin | 10000011110010001001… |
… | …111010100110000000000 |
3 | 11000012220221101101001102 |
4 | 100132101033110300000 |
5 | 122021330324043240 |
6 | 2224012321353532 |
7 | 144533224456346 |
oct | 20362117246000 |
9 | 4005827341042 |
10 | 1132013112320 |
11 | 3a70a1988112 |
12 | 163484a988a8 |
13 | 82996258a9c |
14 | 3cb0b021996 |
15 | 1e6a61cc815 |
hex | 107913d4c00 |
1132013112320 has 44 divisors (see below), whose sum is σ = 2715504903984. Its totient is φ = 452805242880.
The previous prime is 1132013112283. The next prime is 1132013112323. The reversal of 1132013112320 is 232113102311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1132013112292 and 1132013112301.
It is not an unprimeable number, because it can be changed into a prime (1132013112323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110543036 + ... + 110553275.
Almost surely, 21132013112320 is an apocalyptic number.
1132013112320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1132013112320 is an abundant number, since it is smaller than the sum of its proper divisors (1583491791664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132013112320 is an equidigital number, since it uses as much as digits as its factorization.
1132013112320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221096336 (or 221096318 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1132013112320 its reverse (232113102311), we get a palindrome (1364126214631).
The spelling of 1132013112320 in words is "one trillion, one hundred thirty-two billion, thirteen million, one hundred twelve thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •