Base | Representation |
---|---|
bin | 10101001000010100… |
… | …00000011110101100 |
3 | 1002021120202222220111 |
4 | 22210022000132230 |
5 | 141213032141140 |
6 | 5113353425404 |
7 | 551054406514 |
oct | 124412003654 |
9 | 32246688814 |
10 | 11344021420 |
11 | 48a144a216 |
12 | 224710b264 |
13 | 10ba299514 |
14 | 798862844 |
15 | 465d967ea |
hex | 2a42807ac |
11344021420 has 24 divisors (see below), whose sum is σ = 24271927344. Its totient is φ = 4451992896.
The previous prime is 11344021417. The next prime is 11344021427. The reversal of 11344021420 is 2412044311.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11344021391 and 11344021400.
It is not an unprimeable number, because it can be changed into a prime (11344021427) 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 7 ways as a sum of consecutive naturals, for example, 5349894 + ... + 5352013.
It is an arithmetic number, because the mean of its divisors is an integer number (1011330306).
Almost surely, 211344021420 is an apocalyptic number.
11344021420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11344021420 is an abundant number, since it is smaller than the sum of its proper divisors (12927905924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11344021420 is a wasteful number, since it uses less digits than its factorization.
11344021420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10701969 (or 10701967 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 11344021420 its reverse (2412044311), we get a palindrome (13756065731).
The spelling of 11344021420 in words is "eleven billion, three hundred forty-four million, twenty-one thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •