Base | Representation |
---|---|
bin | 10101010101010011… |
… | …10011110100001010 |
3 | 1002120011212202211122 |
4 | 22222221303310022 |
5 | 141423433141300 |
6 | 5132245555242 |
7 | 553550035043 |
oct | 125251636412 |
9 | 32504782748 |
10 | 11453021450 |
11 | 4947a28592 |
12 | 2277715b22 |
13 | 1106a41690 |
14 | 7a91178ca |
15 | 470727c85 |
hex | 2aaa73d0a |
11453021450 has 48 divisors (see below), whose sum is σ = 23317450296. Its totient is φ = 4159468800.
The previous prime is 11453021443. The next prime is 11453021483. The reversal of 11453021450 is 5412035411.
11453021450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 126315121 + 11326706329 = 11239^2 + 106427^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 104777 + ... + 184076.
Almost surely, 211453021450 is an apocalyptic number.
11453021450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11453021450 is an abundant number, since it is smaller than the sum of its proper divisors (11864428846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11453021450 is a wasteful number, since it uses less digits than its factorization.
11453021450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288939 (or 288934 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 11453021450 its reverse (5412035411), we get a palindrome (16865056861).
The spelling of 11453021450 in words is "eleven billion, four hundred fifty-three million, twenty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •