Base | Representation |
---|---|
bin | 10000011111011101111… |
… | …100100010001001111011 |
3 | 11000100020121221200010211 |
4 | 100133131330202021323 |
5 | 122031444302011443 |
6 | 2224344132451551 |
7 | 144610142221210 |
oct | 20373574421173 |
9 | 4010217850124 |
10 | 1133300032123 |
11 | 3a76a2360aa6 |
12 | 163783a79bb7 |
13 | 82b3ca641ac |
14 | 3cbcdcd9b07 |
15 | 1e72e18719d |
hex | 107ddf2227b |
1133300032123 has 4 divisors (see below), whose sum is σ = 1295200036720. Its totient is φ = 971400027528.
The previous prime is 1133300032091. The next prime is 1133300032169. The reversal of 1133300032123 is 3212300033311.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1133300032123 - 25 = 1133300032091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1133300032094 and 1133300032103.
It is not an unprimeable number, because it can be changed into a prime (1133300002123) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 80950002288 + ... + 80950002301.
It is an arithmetic number, because the mean of its divisors is an integer number (323800009180).
Almost surely, 21133300032123 is an apocalyptic number.
1133300032123 is a deficient number, since it is larger than the sum of its proper divisors (161900004597).
1133300032123 is an equidigital number, since it uses as much as digits as its factorization.
1133300032123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161900004596.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 1133300032123 its reverse (3212300033311), we get a palindrome (4345600065434).
The spelling of 1133300032123 in words is "one trillion, one hundred thirty-three billion, three hundred million, thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •