Base | Representation |
---|---|
bin | 11110000000100101000… |
… | …01111000010000101000 |
3 | 10122120110100020122202021 |
4 | 33000102201320100220 |
5 | 113343144333201440 |
6 | 2105403204114224 |
7 | 134331460035553 |
oct | 17002241702050 |
9 | 3576410218667 |
10 | 1031103022120 |
11 | 368319858856 |
12 | 147a02395974 |
13 | 7630402c042 |
14 | 37c9717969a |
15 | 1bc4c12184a |
hex | f012878428 |
1031103022120 has 32 divisors (see below), whose sum is σ = 2322701667720. Its totient is φ = 411957676800.
The previous prime is 1031103022063. The next prime is 1031103022127. The reversal of 1031103022120 is 212203011301.
It can be written as a sum of positive squares in 4 ways, for example, as 487754179236 + 543348842884 = 698394^2 + 737122^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1031103022094 and 1031103022103.
It is not an unprimeable number, because it can be changed into a prime (1031103022127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15075831 + ... + 15144070.
Almost surely, 21031103022120 is an apocalyptic number.
1031103022120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031103022120 is an abundant number, since it is smaller than the sum of its proper divisors (1291598645600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031103022120 is a wasteful number, since it uses less digits than its factorization.
1031103022120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30220765 (or 30220761 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1031103022120 its reverse (212203011301), we get a palindrome (1243306033421).
The spelling of 1031103022120 in words is "one trillion, thirty-one billion, one hundred three million, twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •