Base | Representation |
---|---|
bin | 100001101111010… |
… | …1100101111000110 |
3 | 2220220021201002112 |
4 | 1003132230233012 |
5 | 4304310333110 |
6 | 304201141022 |
7 | 40024604255 |
oct | 10336545706 |
9 | 2826251075 |
10 | 1132121030 |
11 | 531064317 |
12 | 27718a772 |
13 | 150719201 |
14 | aa50079c |
15 | 695cd405 |
hex | 437acbc6 |
1132121030 has 8 divisors (see below), whose sum is σ = 2037817872. Its totient is φ = 452848408.
The previous prime is 1132120991. The next prime is 1132121033. The reversal of 1132121030 is 301212311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1132120996 and 1132121014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132121033) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 56606042 + ... + 56606061.
It is an arithmetic number, because the mean of its divisors is an integer number (254727234).
Almost surely, 21132121030 is an apocalyptic number.
1132121030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1132121030 is a deficient number, since it is larger than the sum of its proper divisors (905696842).
1132121030 is a wasteful number, since it uses less digits than its factorization.
1132121030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113212110.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1132121030 is about 33647.0062561292. The cubic root of 1132121030 is about 1042.2317182930.
Adding to 1132121030 its reverse (301212311), we get a palindrome (1433333341).
The spelling of 1132121030 in words is "one billion, one hundred thirty-two million, one hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •