Base | Representation |
---|---|
bin | 1010001110110101101011… |
… | …1011111100110110110111 |
3 | 1110211111022222110110020210 |
4 | 2203231122323330312313 |
5 | 2433310043010412211 |
6 | 35532111020000503 |
7 | 2240534413551510 |
oct | 243553273746667 |
9 | 43744288413223 |
10 | 11250045013431 |
11 | 3648132138444 |
12 | 1318401390133 |
13 | 637b4a9136c3 |
14 | 2ac70dd43a07 |
15 | 14798d4159a6 |
hex | a3b5aefcdb7 |
11250045013431 has 48 divisors (see below), whose sum is σ = 17573475225600. Its totient is φ = 6271005707520.
The previous prime is 11250045013429. The next prime is 11250045013481. The reversal of 11250045013431 is 13431054005211.
It is not a de Polignac number, because 11250045013431 - 21 = 11250045013429 is a prime.
It is a super-2 number, since 2×112500450134312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11250045013481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 378023530 + ... + 378053288.
It is an arithmetic number, because the mean of its divisors is an integer number (366114067200).
Almost surely, 211250045013431 is an apocalyptic number.
11250045013431 is a deficient number, since it is larger than the sum of its proper divisors (6323430212169).
11250045013431 is a wasteful number, since it uses less digits than its factorization.
11250045013431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40560 (or 40519 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 11250045013431 its reverse (13431054005211), we get a palindrome (24681099018642).
The spelling of 11250045013431 in words is "eleven trillion, two hundred fifty billion, forty-five million, thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •