Base | Representation |
---|---|
bin | 10101001001000001… |
… | …10111001000110000 |
3 | 1002022000001101002000 |
4 | 22210200313020300 |
5 | 141221100344324 |
6 | 5114130054000 |
7 | 551156341230 |
oct | 124440671060 |
9 | 32260041060 |
10 | 11350012464 |
11 | 48a487139a |
12 | 224911a300 |
13 | 10bb5b640b |
14 | 799581cc0 |
15 | 46667b9c9 |
hex | 2a4837230 |
11350012464 has 160 divisors (see below), whose sum is σ = 39423191040. Its totient is φ = 3052090368.
The previous prime is 11350012451. The next prime is 11350012517. The reversal of 11350012464 is 46421005311.
It is a happy number.
11350012464 is a `hidden beast` number, since 113 + 500 + 1 + 2 + 46 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 58984 + ... + 161799.
It is an arithmetic number, because the mean of its divisors is an integer number (246394944).
Almost surely, 211350012464 is an apocalyptic number.
11350012464 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11350012464 is an abundant number, since it is smaller than the sum of its proper divisors (28073178576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11350012464 is a wasteful number, since it uses less digits than its factorization.
11350012464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220824 (or 220812 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 11350012464 its reverse (46421005311), we get a palindrome (57771017775).
The spelling of 11350012464 in words is "eleven billion, three hundred fifty million, twelve thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •