Base | Representation |
---|---|
bin | 1010000001110100101010… |
… | …1001011100001001011010 |
3 | 1110001010011002210211221120 |
4 | 2200131022221130021122 |
5 | 2421124113424113020 |
6 | 35241250143350110 |
7 | 2215430204455302 |
oct | 240351251341132 |
9 | 43033132724846 |
10 | 11026433426010 |
11 | 3571314235132 |
12 | 12a0bb62b2336 |
13 | 61ca32910532 |
14 | 2a197a052602 |
15 | 141c52125740 |
hex | a074aa5c25a |
11026433426010 has 32 divisors (see below), whose sum is σ = 26463539626560. Its totient is φ = 2940371202048.
The previous prime is 11026433425979. The next prime is 11026433426039. The reversal of 11026433426010 is 1062433462011.
It is a happy number.
It is a super-2 number, since 2×110264334260102 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10295581 + ... + 11315999.
It is an arithmetic number, because the mean of its divisors is an integer number (826985613330).
Almost surely, 211026433426010 is an apocalyptic number.
11026433426010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11026433426010 is an abundant number, since it is smaller than the sum of its proper divisors (15437106200550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11026433426010 is a wasteful number, since it uses less digits than its factorization.
11026433426010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1380622.
The product of its (nonzero) digits is 20736, while the sum is 33.
Adding to 11026433426010 its reverse (1062433462011), we get a palindrome (12088866888021).
The spelling of 11026433426010 in words is "eleven trillion, twenty-six billion, four hundred thirty-three million, four hundred twenty-six thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •