Base | Representation |
---|---|
bin | 10000011110010111100… |
… | …111111100100011110010 |
3 | 11000020012101221112001201 |
4 | 100132113213330203302 |
5 | 122022040234331010 |
6 | 2224031105321414 |
7 | 144535665115231 |
oct | 20362747744362 |
9 | 4006171845051 |
10 | 1132120230130 |
11 | 3a71473a032a |
12 | 1634b493626a |
13 | 829b24c22c6 |
14 | 3cb1b346b18 |
15 | 1e6b07db23a |
hex | 107979fc8f2 |
1132120230130 has 32 divisors (see below), whose sum is σ = 2146877472960. Its totient is φ = 428652469440.
The previous prime is 1132120230121. The next prime is 1132120230133. The reversal of 1132120230130 is 310320212311.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 1132120230098 and 1132120230107.
It is not an unprimeable number, because it can be changed into a prime (1132120230133) 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, 2284381 + ... + 2735440.
It is an arithmetic number, because the mean of its divisors is an integer number (67089921030).
Almost surely, 21132120230130 is an apocalyptic number.
1132120230130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1132120230130 is a deficient number, since it is larger than the sum of its proper divisors (1014757242830).
1132120230130 is a wasteful number, since it uses less digits than its factorization.
1132120230130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5021034.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1132120230130 its reverse (310320212311), we get a palindrome (1442440442441).
The spelling of 1132120230130 in words is "one trillion, one hundred thirty-two billion, one hundred twenty million, two hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •