Base | Representation |
---|---|
bin | 10000011110101010110… |
… | …100111011110101001011 |
3 | 11000021000212011112221202 |
4 | 100132222310323311023 |
5 | 122023220223331443 |
6 | 2224123054454415 |
7 | 144546656411204 |
oct | 20365264736513 |
9 | 4007025145852 |
10 | 1132442402123 |
11 | 3a72a223897a |
12 | 16358480440b |
13 | 82a34184016 |
14 | 3cb4c04c5ab |
15 | 1e6cdc297b8 |
hex | 107aad3bd4b |
1132442402123 has 16 divisors (see below), whose sum is σ = 1156566808320. Its totient is φ = 1108501524000.
The previous prime is 1132442402093. The next prime is 1132442402137. The reversal of 1132442402123 is 3212042442311.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1132442402123 is a prime.
It is a super-2 number, since 2×11324424021232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1132442402173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35307668 + ... + 35339726.
It is an arithmetic number, because the mean of its divisors is an integer number (72285425520).
Almost surely, 21132442402123 is an apocalyptic number.
1132442402123 is a deficient number, since it is larger than the sum of its proper divisors (24124406197).
1132442402123 is a wasteful number, since it uses less digits than its factorization.
1132442402123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34898.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 1132442402123 its reverse (3212042442311), we get a palindrome (4344484844434).
The spelling of 1132442402123 in words is "one trillion, one hundred thirty-two billion, four hundred forty-two million, four hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •