Base | Representation |
---|---|
bin | 100001101101010… |
… | …0101000011111111 |
3 | 2220211020211121021 |
4 | 1003122211003333 |
5 | 4304021303043 |
6 | 304122045011 |
7 | 40012455460 |
oct | 10332450377 |
9 | 2824224537 |
10 | 1131041023 |
11 | 530496952 |
12 | 276949767 |
13 | 15042b758 |
14 | aa2dcd67 |
15 | 694683ed |
hex | 436a50ff |
1131041023 has 8 divisors (see below), whose sum is σ = 1293880320. Its totient is φ = 968517240.
The previous prime is 1131040979. The next prime is 1131041027. The reversal of 1131041023 is 3201401311.
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 1131041023 - 225 = 1097486591 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1131040988 and 1131041006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131041027) 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 7 ways as a sum of consecutive naturals, for example, 71143 + ... + 85576.
It is an arithmetic number, because the mean of its divisors is an integer number (161735040).
Almost surely, 21131041023 is an apocalyptic number.
1131041023 is a deficient number, since it is larger than the sum of its proper divisors (162839297).
1131041023 is a wasteful number, since it uses less digits than its factorization.
1131041023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157757.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1131041023 is about 33630.9533465824. The cubic root of 1131041023 is about 1041.9001943524.
Adding to 1131041023 its reverse (3201401311), we get a palindrome (4332442334).
The spelling of 1131041023 in words is "one billion, one hundred thirty-one million, forty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •