Base | Representation |
---|---|
bin | 10101011101110100… |
… | …10000100100011101 |
3 | 1002202011021022221220 |
4 | 22232322100210131 |
5 | 142100224124042 |
6 | 5143320443553 |
7 | 555405100266 |
oct | 125672204435 |
9 | 32664238856 |
10 | 11524442397 |
11 | 498427a166 |
12 | 22976195b9 |
13 | 1118789bb0 |
14 | 7b47c996d |
15 | 476b348ec |
hex | 2aee9091d |
11524442397 has 16 divisors (see below), whose sum is σ = 16551644928. Its totient is φ = 7090367040.
The previous prime is 11524442393. The next prime is 11524442411. The reversal of 11524442397 is 79324442511.
11524442397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11524442397 - 22 = 11524442393 is a prime.
It is a super-2 number, since 2×115244423972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11524442393) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 155647 + ... + 217427.
It is an arithmetic number, because the mean of its divisors is an integer number (1034477808).
Almost surely, 211524442397 is an apocalyptic number.
It is an amenable number.
11524442397 is a deficient number, since it is larger than the sum of its proper divisors (5027202531).
11524442397 is a wasteful number, since it uses less digits than its factorization.
11524442397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66580.
The product of its digits is 241920, while the sum is 42.
It can be divided in two parts, 115244 and 42397, that added together give a triangular number (157641 = T561).
The spelling of 11524442397 in words is "eleven billion, five hundred twenty-four million, four hundred forty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •