Base | Representation |
---|---|
bin | 10000011110010001110… |
… | …101110100000101010011 |
3 | 11000012221122100222200010 |
4 | 100132101311310011103 |
5 | 122021340414432011 |
6 | 2224013321530003 |
7 | 144533406311613 |
oct | 20362165640523 |
9 | 4005848328603 |
10 | 1132023202131 |
11 | 3a70a76497a8 |
12 | 163488343903 |
13 | 8299837c4a3 |
14 | 3cb0c4caa43 |
15 | 1e6a70221a6 |
hex | 10791d74153 |
1132023202131 has 16 divisors (see below), whose sum is σ = 1519972061184. Its totient is φ = 749395602144.
The previous prime is 1132023202111. The next prime is 1132023202133. The reversal of 1132023202131 is 1312023202311.
It is not a de Polignac number, because 1132023202131 - 29 = 1132023201619 is a prime.
It is a super-2 number, since 2×11320232021312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1132023202098 and 1132023202107.
It is not an unprimeable number, because it can be changed into a prime (1132023202133) 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 15 ways as a sum of consecutive naturals, for example, 1909276 + ... + 2430921.
It is an arithmetic number, because the mean of its divisors is an integer number (94998253824).
Almost surely, 21132023202131 is an apocalyptic number.
1132023202131 is a deficient number, since it is larger than the sum of its proper divisors (387948859053).
1132023202131 is a wasteful number, since it uses less digits than its factorization.
1132023202131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4340810.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1132023202131 its reverse (1312023202311), we get a palindrome (2444046404442).
The spelling of 1132023202131 in words is "one trillion, one hundred thirty-two billion, twenty-three million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •