Base | Representation |
---|---|
bin | 10101001100001000… |
… | …00110011011110111 |
3 | 1002100211000001211112 |
4 | 22212010012123313 |
5 | 141244230334013 |
6 | 5120455425235 |
7 | 551623431410 |
oct | 124604063367 |
9 | 32324001745 |
10 | 11376027383 |
11 | 490851a826 |
12 | 225598521b |
13 | 10c3ac4566 |
14 | 79cbd4807 |
15 | 468ab9ba8 |
hex | 2a61066f7 |
11376027383 has 8 divisors (see below), whose sum is σ = 13038429600. Its totient is φ = 9722939040.
The previous prime is 11376027379. The next prime is 11376027419. The reversal of 11376027383 is 38372067311.
11376027383 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 a cyclic number.
It is not a de Polignac number, because 11376027383 - 22 = 11376027379 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11376027383.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11376021383) 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, 2325848 + ... + 2330733.
It is an arithmetic number, because the mean of its divisors is an integer number (1629803700).
Almost surely, 211376027383 is an apocalyptic number.
11376027383 is a deficient number, since it is larger than the sum of its proper divisors (1662402217).
11376027383 is an equidigital number, since it uses as much as digits as its factorization.
11376027383 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4656937.
The product of its (nonzero) digits is 127008, while the sum is 41.
The spelling of 11376027383 in words is "eleven billion, three hundred seventy-six million, twenty-seven thousand, three hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •