Base | Representation |
---|---|
bin | 10000101010011110100… |
… | …000010000000001011101 |
3 | 11001110202102100110022011 |
4 | 100222132200100001131 |
5 | 122230201330230401 |
6 | 2234021111351221 |
7 | 145506104055265 |
oct | 20523640200135 |
9 | 4043672313264 |
10 | 1145120555101 |
11 | 401708777956 |
12 | 165b22682511 |
13 | 83ca4978ba3 |
14 | 3d5d1b587a5 |
15 | 1ebc1ca4451 |
hex | 10a9e81005d |
1145120555101 has 4 divisors (see below), whose sum is σ = 1212480587772. Its totient is φ = 1077760522432.
The previous prime is 1145120555057. The next prime is 1145120555147. The reversal of 1145120555101 is 1015550215411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 601547604025 + 543572951076 = 775595^2 + 737274^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145120555101 - 213 = 1145120546909 is a prime.
It is a super-2 number, since 2×11451205551012 (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 (1145120555191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33680016310 + ... + 33680016343.
It is an arithmetic number, because the mean of its divisors is an integer number (303120146943).
Almost surely, 21145120555101 is an apocalyptic number.
It is an amenable number.
1145120555101 is a deficient number, since it is larger than the sum of its proper divisors (67360032671).
1145120555101 is an equidigital number, since it uses as much as digits as its factorization.
1145120555101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67360032670.
The product of its (nonzero) digits is 5000, while the sum is 31.
The spelling of 1145120555101 in words is "one trillion, one hundred forty-five billion, one hundred twenty million, five hundred fifty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •