Base | Representation |
---|---|
bin | 11110000000110011010… |
… | …00001010011111111000 |
3 | 10122120202122022221212220 |
4 | 33000121220022133320 |
5 | 113343420330011300 |
6 | 2105423100404040 |
7 | 134334434211252 |
oct | 17003150123770 |
9 | 3576678287786 |
10 | 1031222110200 |
11 | 36837aaa7457 |
12 | 147a36246620 |
13 | 763228c6b69 |
14 | 37ca8cd8cd2 |
15 | 1bc577e6da0 |
hex | f019a0a7f8 |
1031222110200 has 48 divisors (see below), whose sum is σ = 3196788543480. Its totient is φ = 274992562560.
The previous prime is 1031222110189. The next prime is 1031222110213. The reversal of 1031222110200 is 20112221301.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1031222110200.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 859351159 + ... + 859352358.
Almost surely, 21031222110200 is an apocalyptic number.
1031222110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031222110200 is an abundant number, since it is smaller than the sum of its proper divisors (2165566433280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031222110200 is a wasteful number, since it uses less digits than its factorization.
1031222110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1718703536 (or 1718703527 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1031222110200 its reverse (20112221301), we get a palindrome (1051334331501).
The spelling of 1031222110200 in words is "one trillion, thirty-one billion, two hundred twenty-two million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •