Base | Representation |
---|---|
bin | 10000010011001101001… |
… | …001000110110001110111 |
3 | 10222002021000020222021112 |
4 | 100103031021012301313 |
5 | 121323013100311203 |
6 | 2214325422105235 |
7 | 143632642134266 |
oct | 20231511066167 |
9 | 3862230228245 |
10 | 1120133213303 |
11 | 3a2055aa7155 |
12 | 16110a41b21b |
13 | 81821c55140 |
14 | 3c3013485dd |
15 | 1e20d2826d8 |
hex | 104cd246c77 |
1120133213303 has 16 divisors (see below), whose sum is σ = 1207179288000. Its totient is φ = 1033213474560.
The previous prime is 1120133213263. The next prime is 1120133213327. The reversal of 1120133213303 is 3033123310211.
It is a cyclic number.
It is not a de Polignac number, because 1120133213303 - 28 = 1120133213047 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120133213383) 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 in 15 ways as a sum of consecutive naturals, for example, 183957083 + ... + 183963171.
It is an arithmetic number, because the mean of its divisors is an integer number (75448705500).
Almost surely, 21120133213303 is an apocalyptic number.
1120133213303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1120133213303 is a deficient number, since it is larger than the sum of its proper divisors (87046074697).
1120133213303 is a wasteful number, since it uses less digits than its factorization.
1120133213303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14122.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1120133213303 its reverse (3033123310211), we get a palindrome (4153256523514).
The spelling of 1120133213303 in words is "one trillion, one hundred twenty billion, one hundred thirty-three million, two hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •