Base | Representation |
---|---|
bin | 10101011100011000… |
… | …00001010110101010 |
3 | 1002201022110112010221 |
4 | 22232030001112222 |
5 | 142034123241300 |
6 | 5142205000254 |
7 | 555200055250 |
oct | 125614012652 |
9 | 32638415127 |
10 | 11512321450 |
11 | 4978450553 |
12 | 229355308a |
13 | 1116104b36 |
14 | 7b2d525d0 |
15 | 475a3d31a |
hex | 2ae3015aa |
11512321450 has 24 divisors (see below), whose sum is σ = 24471906912. Its totient is φ = 3947081520.
The previous prime is 11512321439. The next prime is 11512321459. The reversal of 11512321450 is 5412321511.
11512321450 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (11512321459) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16445824 + ... + 16446523.
It is an arithmetic number, because the mean of its divisors is an integer number (1019662788).
Almost surely, 211512321450 is an apocalyptic number.
11512321450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11512321450 is an abundant number, since it is smaller than the sum of its proper divisors (12959585462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11512321450 is a wasteful number, since it uses less digits than its factorization.
11512321450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32892366 (or 32892361 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 11512321450 its reverse (5412321511), we get a palindrome (16924642961).
The spelling of 11512321450 in words is "eleven billion, five hundred twelve million, three hundred twenty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •