Base | Representation |
---|---|
bin | 10101010101011110… |
… | …01100100001111000 |
3 | 1002120021112111200002 |
4 | 22222233030201320 |
5 | 141424313332100 |
6 | 5132340132132 |
7 | 553565035364 |
oct | 125257144170 |
9 | 32507474602 |
10 | 11454433400 |
11 | 4948802393 |
12 | 2278097048 |
13 | 1107117257 |
14 | 7a93a42a4 |
15 | 4709062d5 |
hex | 2aabcc878 |
11454433400 has 48 divisors (see below), whose sum is σ = 28198128240. Its totient is φ = 4312256000.
The previous prime is 11454433399. The next prime is 11454433421. The reversal of 11454433400 is 433445411.
It is a happy number.
11454433400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 1681076 + ... + 1687875.
It is an arithmetic number, because the mean of its divisors is an integer number (587461005).
Almost surely, 211454433400 is an apocalyptic number.
11454433400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11454433400 is an abundant number, since it is smaller than the sum of its proper divisors (16743694840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11454433400 is a wasteful number, since it uses less digits than its factorization.
11454433400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3368984 (or 3368975 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 11454433400 its reverse (433445411), we get a palindrome (11887878811).
The spelling of 11454433400 in words is "eleven billion, four hundred fifty-four million, four hundred thirty-three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •