Base | Representation |
---|---|
bin | 11110000000100110011… |
… | …01101010110000011110 |
3 | 10122120111010211212000112 |
4 | 33000103031222300132 |
5 | 113343210303014100 |
6 | 2105404254130022 |
7 | 134331656435246 |
oct | 17002315526036 |
9 | 3576433755015 |
10 | 1031114501150 |
11 | 368325289158 |
12 | 147a061b0912 |
13 | 7630651ab76 |
14 | 37c988c6b26 |
15 | 1bc4d13cb35 |
hex | f01336ac1e |
1031114501150 has 48 divisors (see below), whose sum is σ = 1923138406800. Its totient is φ = 411314069760.
The previous prime is 1031114501117. The next prime is 1031114501159. The reversal of 1031114501150 is 511054111301.
It is a super-2 number, since 2×10311145011502 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031114501159) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 101692781 + ... + 101702919.
It is an arithmetic number, because the mean of its divisors is an integer number (40065383475).
Almost surely, 21031114501150 is an apocalyptic number.
1031114501150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1031114501150 is a deficient number, since it is larger than the sum of its proper divisors (892023905650).
1031114501150 is a wasteful number, since it uses less digits than its factorization.
1031114501150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15533 (or 15528 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 23.
Adding to 1031114501150 its reverse (511054111301), we get a palindrome (1542168612451).
The spelling of 1031114501150 in words is "one trillion, thirty-one billion, one hundred fourteen million, five hundred one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •