Base | Representation |
---|---|
bin | 10101001111001000… |
… | …01011001000001000 |
3 | 1002102120101121012211 |
4 | 22213210023020020 |
5 | 141322202244144 |
6 | 5123155314504 |
7 | 552350464240 |
oct | 124744131010 |
9 | 32376347184 |
10 | 11401212424 |
11 | 4920761708 |
12 | 22622aba34 |
13 | 10c90a1a54 |
14 | 7a22acb20 |
15 | 46ade2034 |
hex | 2a790b208 |
11401212424 has 64 divisors (see below), whose sum is σ = 26372563200. Its totient is φ = 4512609024.
The previous prime is 11401212421. The next prime is 11401212437. The reversal of 11401212424 is 42421210411.
It is a junction number, because it is equal to n+sod(n) for n = 11401212395 and 11401212404.
It is not an unprimeable number, because it can be changed into a prime (11401212421) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 115267 + ... + 189970.
It is an arithmetic number, because the mean of its divisors is an integer number (412071300).
Almost surely, 211401212424 is an apocalyptic number.
11401212424 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11401212424 is an abundant number, since it is smaller than the sum of its proper divisors (14971350776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11401212424 is a wasteful number, since it uses less digits than its factorization.
11401212424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305302 (or 305298 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 11401212424 its reverse (42421210411), we get a palindrome (53822422835).
The spelling of 11401212424 in words is "eleven billion, four hundred one million, two hundred twelve thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •