Base | Representation |
---|---|
bin | 10000011100100001110… |
… | …101010011111110001101 |
3 | 11000001002200100202201022 |
4 | 100130201311103332031 |
5 | 122004013332204123 |
6 | 2223103032323525 |
7 | 144436010455550 |
oct | 20344165237615 |
9 | 4001080322638 |
10 | 1130144022413 |
11 | 3a632292420a |
12 | 163042b435a5 |
13 | 82758c58523 |
14 | 3c9b0ac2697 |
15 | 1e5e70781c8 |
hex | 10721d53f8d |
1130144022413 has 8 divisors (see below), whose sum is σ = 1315962851328. Its totient is φ = 950417614224.
The previous prime is 1130144022379. The next prime is 1130144022419. The reversal of 1130144022413 is 3142204410311.
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 1130144022413 - 230 = 1129070280589 is a prime.
It is a super-2 number, since 2×11301440224132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130144022419) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1523104781 + ... + 1523105522.
It is an arithmetic number, because the mean of its divisors is an integer number (164495356416).
Almost surely, 21130144022413 is an apocalyptic number.
It is an amenable number.
1130144022413 is a deficient number, since it is larger than the sum of its proper divisors (185818828915).
1130144022413 is an equidigital number, since it uses as much as digits as its factorization.
1130144022413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3046210363.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 1130144022413 its reverse (3142204410311), we get a palindrome (4272348432724).
The spelling of 1130144022413 in words is "one trillion, one hundred thirty billion, one hundred forty-four million, twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •