Base | Representation |
---|---|
bin | 10101000110001100… |
… | …11001111010010110 |
3 | 1002020100102122102010 |
4 | 22203012121322112 |
5 | 141144013043143 |
6 | 5111521525050 |
7 | 550450650132 |
oct | 124306317226 |
9 | 32210378363 |
10 | 11326299798 |
11 | 4892445750 |
12 | 22411a3786 |
13 | 10b6703158 |
14 | 79636c3c2 |
15 | 464545a33 |
hex | 2a3199e96 |
11326299798 has 64 divisors (see below), whose sum is σ = 26909625600. Its totient is φ = 3139436160.
The previous prime is 11326299781. The next prime is 11326299799. The reversal of 11326299798 is 89799262311.
11326299798 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×113262997982 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11326299799) 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 31 ways as a sum of consecutive naturals, for example, 119361 + ... + 192092.
It is an arithmetic number, because the mean of its divisors is an integer number (420462900).
Almost surely, 211326299798 is an apocalyptic number.
11326299798 is an abundant number, since it is smaller than the sum of its proper divisors (15583325802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11326299798 is a wasteful number, since it uses less digits than its factorization.
11326299798 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311517.
The product of its digits is 2939328, while the sum is 57.
The spelling of 11326299798 in words is "eleven billion, three hundred twenty-six million, two hundred ninety-nine thousand, seven hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •