Base | Representation |
---|---|
bin | 11110000000101000101… |
… | …01000000001011100010 |
3 | 10122120112110000220120002 |
4 | 33000110111000023202 |
5 | 113343230044413442 |
6 | 2105410203020002 |
7 | 134332304411153 |
oct | 17002425001342 |
9 | 3576473026502 |
10 | 1031133201122 |
11 | 3683348a0782 |
12 | 147a1050a602 |
13 | 7630a36763b |
14 | 37c9b19392a |
15 | 1bc4ead3732 |
hex | f0145402e2 |
1031133201122 has 4 divisors (see below), whose sum is σ = 1546699801686. Its totient is φ = 515566600560.
The previous prime is 1031133201121. The next prime is 1031133201127. The reversal of 1031133201122 is 2211023311301.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 716323556881 + 314809644241 = 846359^2 + 561079^2 .
It is a super-3 number, since 3×10311332011223 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1031133201094 and 1031133201103.
It is not an unprimeable number, because it can be changed into a prime (1031133201121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 257783300279 + ... + 257783300282.
Almost surely, 21031133201122 is an apocalyptic number.
1031133201122 is a deficient number, since it is larger than the sum of its proper divisors (515566600564).
1031133201122 is an equidigital number, since it uses as much as digits as its factorization.
1031133201122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 515566600563.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1031133201122 its reverse (2211023311301), we get a palindrome (3242156512423).
The spelling of 1031133201122 in words is "one trillion, thirty-one billion, one hundred thirty-three million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •