Base | Representation |
---|---|
bin | 10000011100100110011… |
… | …111111111111110001001 |
3 | 11000001022010200202221011 |
4 | 100130212133333332021 |
5 | 122004143403242140 |
6 | 2223114510443521 |
7 | 144440651136112 |
oct | 20344637777611 |
9 | 4001263622834 |
10 | 1130222321545 |
11 | 3a6363043539 |
12 | 1630652035a1 |
13 | 8276c241685 |
14 | 3c9bb265209 |
15 | 1e5edd92cea |
hex | 107267fff89 |
1130222321545 has 8 divisors (see below), whose sum is σ = 1368942177024. Its totient is φ = 895727596464.
The previous prime is 1130222321513. The next prime is 1130222321549. The reversal of 1130222321545 is 5451232220311.
It is a happy number.
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 1130222321545 - 25 = 1130222321513 is a prime.
It is a super-2 number, since 2×11302223215452 (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 (1130222321549) 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, 1056282009 + ... + 1056283078.
It is an arithmetic number, because the mean of its divisors is an integer number (171117772128).
Almost surely, 21130222321545 is an apocalyptic number.
It is an amenable number.
1130222321545 is a deficient number, since it is larger than the sum of its proper divisors (238719855479).
1130222321545 is a wasteful number, since it uses less digits than its factorization.
1130222321545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2112565199.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 1130222321545 its reverse (5451232220311), we get a palindrome (6581454541856).
The spelling of 1130222321545 in words is "one trillion, one hundred thirty billion, two hundred twenty-two million, three hundred twenty-one thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •