Base | Representation |
---|---|
bin | 10000011100100001000… |
… | …111011101011000011011 |
3 | 11000001001211202002021002 |
4 | 100130201013131120123 |
5 | 122004002243033311 |
6 | 2223101522535215 |
7 | 144435503343563 |
oct | 20344107353033 |
9 | 4001054662232 |
10 | 1130132002331 |
11 | 3a6317064362 |
12 | 16303ab0750b |
13 | 8275660a357 |
14 | 3c9ad273da3 |
15 | 1e5e5ea193b |
hex | 107211dd61b |
1130132002331 has 8 divisors (see below), whose sum is σ = 1151542872000. Its totient is φ = 1108724378112.
The previous prime is 1130132002303. The next prime is 1130132002379. The reversal of 1130132002331 is 1332002310311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1130132002331 - 210 = 1130132001307 is a prime.
It is a super-2 number, since 2×11301320023312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1130132002381) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 102515 + ... + 1506908.
It is an arithmetic number, because the mean of its divisors is an integer number (143942859000).
Almost surely, 21130132002331 is an apocalyptic number.
1130132002331 is a deficient number, since it is larger than the sum of its proper divisors (21410869669).
1130132002331 is a wasteful number, since it uses less digits than its factorization.
1130132002331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1622725.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1130132002331 its reverse (1332002310311), we get a palindrome (2462134312642).
The spelling of 1130132002331 in words is "one trillion, one hundred thirty billion, one hundred thirty-two million, two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •