Base | Representation |
---|---|
bin | 10000011100100101011… |
… | …011010111100000010000 |
3 | 11000001020212211201011122 |
4 | 100130211123113200100 |
5 | 122004124302030000 |
6 | 2223113025101412 |
7 | 144440342203454 |
oct | 20344533274020 |
9 | 4001225751148 |
10 | 1130204330000 |
11 | 3a6353975199 |
12 | 16305b187868 |
13 | 827685b24a5 |
14 | 3c9b8b00664 |
15 | 1e5ec4dc085 |
hex | 107256d7810 |
1130204330000 has 100 divisors (see below), whose sum is σ = 2787968024028. Its totient is φ = 443551680000.
The previous prime is 1130204329973. The next prime is 1130204330023. The reversal of 1130204330000 is 334020311.
It is a happy number.
It can be written as a sum of positive squares in 10 ways, for example, as 654209204224 + 475995125776 = 808832^2 + 689924^2 .
It is a tau number, because it is divible by the number of its divisors (100).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 536231 + ... + 1596230.
Almost surely, 21130204330000 is an apocalyptic number.
1130204330000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1130204330000 is an abundant number, since it is smaller than the sum of its proper divisors (1657763694028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130204330000 is an equidigital number, since it uses as much as digits as its factorization.
1130204330000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2132542 (or 2132521 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 1130204330000 its reverse (334020311), we get a palindrome (1130538350311).
The spelling of 1130204330000 in words is "one trillion, one hundred thirty billion, two hundred four million, three hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •