Base | Representation |
---|---|
bin | 10100111100011011… |
… | …01100000011011010 |
3 | 1002000122011210102200 |
4 | 22132031230003122 |
5 | 141012021314114 |
6 | 5055432511030 |
7 | 545434111620 |
oct | 123615540332 |
9 | 32018153380 |
10 | 11244323034 |
11 | 485014435a |
12 | 221984b476 |
13 | 10a27300a9 |
14 | 78950d510 |
15 | 45c251409 |
hex | 29e36c0da |
11244323034 has 48 divisors (see below), whose sum is σ = 27854394048. Its totient is φ = 3211358976.
The previous prime is 11244322981. The next prime is 11244323047. The reversal of 11244323034 is 43032344211.
11244323034 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11244322989 and 11244323007.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 317989 + ... + 351575.
It is an arithmetic number, because the mean of its divisors is an integer number (580299876).
Almost surely, 211244323034 is an apocalyptic number.
11244323034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11244323034 is an abundant number, since it is smaller than the sum of its proper divisors (16610071014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11244323034 is a wasteful number, since it uses less digits than its factorization.
11244323034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36259 (or 36256 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 11244323034 its reverse (43032344211), we get a palindrome (54276667245).
The spelling of 11244323034 in words is "eleven billion, two hundred forty-four million, three hundred twenty-three thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •