Base | Representation |
---|---|
bin | 11110000000101010101… |
… | …01100000010101100101 |
3 | 10122120120121211222020210 |
4 | 33000111111200111211 |
5 | 113343243412010203 |
6 | 2105412005250033 |
7 | 134332601214300 |
oct | 17002525402545 |
9 | 3576517758223 |
10 | 1031150110053 |
11 | 36834339a6a8 |
12 | 147a16103919 |
13 | 76310a07b1b |
14 | 37c9d515b37 |
15 | 1bc51323803 |
hex | f015560565 |
1031150110053 has 12 divisors (see below), whose sum is σ = 1599334864800. Its totient is φ = 589228634232.
The previous prime is 1031150110033. The next prime is 1031150110079. The reversal of 1031150110053 is 3500110511301.
It is not a de Polignac number, because 1031150110053 - 26 = 1031150109989 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031150110033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3507313153 + ... + 3507313446.
It is an arithmetic number, because the mean of its divisors is an integer number (133277905400).
Almost surely, 21031150110053 is an apocalyptic number.
It is an amenable number.
1031150110053 is a deficient number, since it is larger than the sum of its proper divisors (568184754747).
1031150110053 is an equidigital number, since it uses as much as digits as its factorization.
1031150110053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7014626616 (or 7014626609 counting only the distinct ones).
The product of its (nonzero) digits is 225, while the sum is 21.
Adding to 1031150110053 its reverse (3500110511301), we get a palindrome (4531260621354).
The spelling of 1031150110053 in words is "one trillion, thirty-one billion, one hundred fifty million, one hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •