Base | Representation |
---|---|
bin | 10000011111011110100… |
… | …111100110100001110110 |
3 | 11000100021102012021020221 |
4 | 100133132213212201312 |
5 | 122032010144302410 |
6 | 2224345214444554 |
7 | 144610340203033 |
oct | 20373647464166 |
9 | 4010242167227 |
10 | 1133311322230 |
11 | 3a76a877246a |
12 | 16378780375a |
13 | 82b421b8029 |
14 | 3cbd15d838a |
15 | 1e7301674da |
hex | 107de9e6876 |
1133311322230 has 32 divisors (see below), whose sum is σ = 2050425057600. Its totient is φ = 450999521280.
The previous prime is 1133311322197. The next prime is 1133311322347. The reversal of 1133311322230 is 322231133311.
It is a junction number, because it is equal to n+sod(n) for n = 1133311322195 and 1133311322204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23937942 + ... + 23985238.
It is an arithmetic number, because the mean of its divisors is an integer number (64075783050).
Almost surely, 21133311322230 is an apocalyptic number.
1133311322230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1133311322230 is a deficient number, since it is larger than the sum of its proper divisors (917113735370).
1133311322230 is a wasteful number, since it uses less digits than its factorization.
1133311322230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59544.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1133311322230 its reverse (322231133311), we get a palindrome (1455542455541).
It can be divided in two parts, 1133311 and 322230, that added together give a palindrome (1455541).
The spelling of 1133311322230 in words is "one trillion, one hundred thirty-three billion, three hundred eleven million, three hundred twenty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •