Base | Representation |
---|---|
bin | 10101001000110100… |
… | …11110000011000000 |
3 | 1002021212220020112120 |
4 | 22210122132003000 |
5 | 141220133234312 |
6 | 5114030124240 |
7 | 551136162060 |
oct | 124432360300 |
9 | 32255806476 |
10 | 11348336832 |
11 | 48a3927478 |
12 | 2248650680 |
13 | 10bb14a811 |
14 | 7992673a0 |
15 | 46644a28c |
hex | 2a469e0c0 |
11348336832 has 56 divisors (see below), whose sum is σ = 34315213056. Its totient is φ = 3242381568.
The previous prime is 11348336821. The next prime is 11348336843. The reversal of 11348336832 is 23863384311.
It is an interprime number because it is at equal distance from previous prime (11348336821) and next prime (11348336843).
It is a tau number, because it is divible by the number of its divisors (56).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a nude number because it is divisible by every one of its digits.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4220508 + ... + 4223195.
Almost surely, 211348336832 is an apocalyptic number.
11348336832 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11348336832 is an abundant number, since it is smaller than the sum of its proper divisors (22966876224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11348336832 is an equidigital number, since it uses as much as digits as its factorization.
11348336832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8443725 (or 8443715 counting only the distinct ones).
The product of its digits is 248832, while the sum is 42.
The spelling of 11348336832 in words is "eleven billion, three hundred forty-eight million, three hundred thirty-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •