Base | Representation |
---|---|
bin | 10000011100100110011… |
… | …011000101101001111000 |
3 | 11000001022001021100220011 |
4 | 100130212123011221320 |
5 | 122004143041042404 |
6 | 2223114423111304 |
7 | 144440634164461 |
oct | 20344633055170 |
9 | 4001261240804 |
10 | 1130221034104 |
11 | 3a6362344238 |
12 | 1630648a2534 |
13 | 8276bbb0686 |
14 | 3c9bb00bd68 |
15 | 1e5edbdb604 |
hex | 107266c5a78 |
1130221034104 has 8 divisors (see below), whose sum is σ = 2119164438960. Its totient is φ = 565110517048.
The previous prime is 1130221034101. The next prime is 1130221034123. The reversal of 1130221034104 is 4014301220311.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×11302210341042 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130221034101) 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 as a sum of consecutive naturals, namely, 70638814624 + ... + 70638814639.
It is an arithmetic number, because the mean of its divisors is an integer number (264895554870).
Almost surely, 21130221034104 is an apocalyptic number.
It is an amenable number.
1130221034104 is a deficient number, since it is larger than the sum of its proper divisors (988943404856).
1130221034104 is a wasteful number, since it uses less digits than its factorization.
1130221034104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141277629269 (or 141277629265 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1130221034104 its reverse (4014301220311), we get a palindrome (5144522254415).
The spelling of 1130221034104 in words is "one trillion, one hundred thirty billion, two hundred twenty-one million, thirty-four thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •