Base | Representation |
---|---|
bin | 10100110001001110… |
… | …11111100111010111 |
3 | 1001210002111020220111 |
4 | 22120213133213113 |
5 | 140314002041120 |
6 | 5042240143451 |
7 | 543214021225 |
oct | 123047374727 |
9 | 31702436814 |
10 | 11150424535 |
11 | 480213aa98 |
12 | 21b2307b87 |
13 | 1089144853 |
14 | 77ac69b15 |
15 | 453da475a |
hex | 2989df9d7 |
11150424535 has 8 divisors (see below), whose sum is σ = 13398189696. Its totient is φ = 8908552800.
The previous prime is 11150424529. The next prime is 11150424539. The reversal of 11150424535 is 53542405111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11150424535 - 231 = 9002940887 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11150424497 and 11150424506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11150424539) 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, 1469191 + ... + 1476760.
It is an arithmetic number, because the mean of its divisors is an integer number (1674773712).
Almost surely, 211150424535 is an apocalyptic number.
11150424535 is a deficient number, since it is larger than the sum of its proper divisors (2247765161).
11150424535 is an equidigital number, since it uses as much as digits as its factorization.
11150424535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2946713.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 11150424535 its reverse (53542405111), we get a palindrome (64692829646).
The spelling of 11150424535 in words is "eleven billion, one hundred fifty million, four hundred twenty-four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •