Base | Representation |
---|---|
bin | 10101010100001111… |
… | …00001001110101110 |
3 | 1002112112222002012222 |
4 | 22222013201032232 |
5 | 141414133014210 |
6 | 5131325155342 |
7 | 553410446015 |
oct | 125207411656 |
9 | 32475862188 |
10 | 11444032430 |
11 | 4942948a46 |
12 | 22746bbb52 |
13 | 1104c1502c |
14 | 7a7c57a7c |
15 | 46ea4e655 |
hex | 2aa1e13ae |
11444032430 has 16 divisors (see below), whose sum is σ = 20860009920. Its totient is φ = 4519668192.
The previous prime is 11444032393. The next prime is 11444032487. The reversal of 11444032430 is 3423044411.
11444032430 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×114440324303 (a number of 31 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11444032430.
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 7 ways as a sum of consecutive naturals, for example, 7242269 + ... + 7243848.
It is an arithmetic number, because the mean of its divisors is an integer number (1303750620).
Almost surely, 211444032430 is an apocalyptic number.
11444032430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11444032430 is a deficient number, since it is larger than the sum of its proper divisors (9415977490).
11444032430 is a wasteful number, since it uses less digits than its factorization.
11444032430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14486203.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 11444032430 its reverse (3423044411), we get a palindrome (14867076841).
The spelling of 11444032430 in words is "eleven billion, four hundred forty-four million, thirty-two thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •