Base | Representation |
---|---|
bin | 10101000110010010… |
… | …11000111111000101 |
3 | 1002020101220101222202 |
4 | 22203021120333011 |
5 | 141144213114222 |
6 | 5111550404245 |
7 | 550460416646 |
oct | 124311307705 |
9 | 32211811882 |
10 | 11327082437 |
11 | 489292a760 |
12 | 2241500685 |
13 | 10b6918458 |
14 | 7964d36cd |
15 | 46464c892 |
hex | 2a3258fc5 |
11327082437 has 8 divisors (see below), whose sum is σ = 12359329920. Its totient is φ = 10295253760.
The previous prime is 11327082433. The next prime is 11327082443. The reversal of 11327082437 is 73428072311.
11327082437 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11327082437 - 22 = 11327082433 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11327082437.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11327082433) 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 7 ways as a sum of consecutive naturals, for example, 46748 + ... + 157605.
It is an arithmetic number, because the mean of its divisors is an integer number (1544916240).
Almost surely, 211327082437 is an apocalyptic number.
It is an amenable number.
11327082437 is a deficient number, since it is larger than the sum of its proper divisors (1032247483).
11327082437 is a wasteful number, since it uses less digits than its factorization.
11327082437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209403.
The product of its (nonzero) digits is 56448, while the sum is 38.
The spelling of 11327082437 in words is "eleven billion, three hundred twenty-seven million, eighty-two thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •