Base | Representation |
---|---|
bin | 1010010011100011101110… |
… | …0101001011110011001010 |
3 | 1111010020121110121200211201 |
4 | 2210320323211023303022 |
5 | 2441122120033032000 |
6 | 40033240213414414 |
7 | 2246434541100103 |
oct | 244707345136312 |
9 | 44106543550751 |
10 | 11331123330250 |
11 | 3679558799949 |
12 | 133006a33a40a |
13 | 64269c2768b9 |
14 | 2b2601db53aa |
15 | 149b363d596a |
hex | a4e3b94bcca |
11331123330250 has 16 divisors (see below), whose sum is σ = 21211862874696. Its totient is φ = 4532449332000.
The previous prime is 11331123330169. The next prime is 11331123330251. The reversal of 11331123330250 is 5203332113311.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 7048446221881 + 4282677108369 = 2654891^2 + 2069463^2 .
It is not an unprimeable number, because it can be changed into a prime (11331123330251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22662246411 + ... + 22662246910.
Almost surely, 211331123330250 is an apocalyptic number.
11331123330250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11331123330250 is a deficient number, since it is larger than the sum of its proper divisors (9880739544446).
11331123330250 is an equidigital number, since it uses as much as digits as its factorization.
11331123330250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45324493338 (or 45324493328 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 28.
Adding to 11331123330250 its reverse (5203332113311), we get a palindrome (16534455443561).
The spelling of 11331123330250 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-three million, three hundred thirty thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •