Base | Representation |
---|---|
bin | 10100100011000010… |
… | …01000001001101011 |
3 | 1001110210100212102010 |
4 | 22101201020021223 |
5 | 140043004040201 |
6 | 5022343211003 |
7 | 540236426241 |
oct | 122141101153 |
9 | 31423325363 |
10 | 11031315051 |
11 | 47509872a9 |
12 | 217a446a63 |
13 | 106a570073 |
14 | 769102791 |
15 | 4486c7bd6 |
hex | 29184826b |
11031315051 has 8 divisors (see below), whose sum is σ = 15482547520. Its totient is φ = 6967146312.
The previous prime is 11031314999. The next prime is 11031315067. The reversal of 11031315051 is 15051313011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11031315051 - 27 = 11031314923 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11031315751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96765865 + ... + 96765978.
It is an arithmetic number, because the mean of its divisors is an integer number (1935318440).
Almost surely, 211031315051 is an apocalyptic number.
11031315051 is a deficient number, since it is larger than the sum of its proper divisors (4451232469).
11031315051 is a wasteful number, since it uses less digits than its factorization.
11031315051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193531865.
The product of its (nonzero) digits is 225, while the sum is 21.
Adding to 11031315051 its reverse (15051313011), we get a palindrome (26082628062).
The spelling of 11031315051 in words is "eleven billion, thirty-one million, three hundred fifteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.563 sec. • engine limits •