Base | Representation |
---|---|
bin | 1010000001110000001011… |
… | …1111000011011100010011 |
3 | 1110001000001022111000012220 |
4 | 2200130002333003130103 |
5 | 2421114133132214220 |
6 | 35240530554152123 |
7 | 2215355335235232 |
oct | 240340277033423 |
9 | 43030038430186 |
10 | 11025231132435 |
11 | 3570857602183 |
12 | 12a091b722643 |
13 | 61c8a07c5110 |
14 | 2a18a44c6b19 |
15 | 141bd17d5540 |
hex | a0702fc3713 |
11025231132435 has 64 divisors (see below), whose sum is σ = 19182615782400. Its totient is φ = 5375085027840.
The previous prime is 11025231132427. The next prime is 11025231132463. The reversal of 11025231132435 is 53423113252011.
It is a happy number.
It is not a de Polignac number, because 11025231132435 - 23 = 11025231132427 is a prime.
It is a super-2 number, since 2×110252311324352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11025231132396 and 11025231132405.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9044002 + ... + 10190408.
It is an arithmetic number, because the mean of its divisors is an integer number (299728371600).
Almost surely, 211025231132435 is an apocalyptic number.
11025231132435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11025231132435 is a deficient number, since it is larger than the sum of its proper divisors (8157384649965).
11025231132435 is a wasteful number, since it uses less digits than its factorization.
11025231132435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1146908.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 11025231132435 its reverse (53423113252011), we get a palindrome (64448344384446).
The spelling of 11025231132435 in words is "eleven trillion, twenty-five billion, two hundred thirty-one million, one hundred thirty-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •