Base | Representation |
---|---|
bin | 10110001011101001… |
… | …11010010010010011 |
3 | 1010201221201122002201 |
4 | 23011310322102103 |
5 | 143342140310441 |
6 | 5245413224031 |
7 | 601054055542 |
oct | 130564722223 |
9 | 33657648081 |
10 | 11908916371 |
11 | 5061300150 |
12 | 2384332017 |
13 | 117a3235a1 |
14 | 80d8ac159 |
15 | 49a77cc31 |
hex | 2c5d3a493 |
11908916371 has 16 divisors (see below), whose sum is σ = 13066168320. Its totient is φ = 10764286720.
The previous prime is 11908916359. The next prime is 11908916377. The reversal of 11908916371 is 17361980911.
11908916371 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11908916371 - 25 = 11908916339 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11908916377) 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 15 ways as a sum of consecutive naturals, for example, 1389726 + ... + 1398268.
It is an arithmetic number, because the mean of its divisors is an integer number (816635520).
Almost surely, 211908916371 is an apocalyptic number.
11908916371 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11908916371 is a deficient number, since it is larger than the sum of its proper divisors (1157251949).
11908916371 is a wasteful number, since it uses less digits than its factorization.
11908916371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9266.
The product of its (nonzero) digits is 81648, while the sum is 46.
It can be divided in two parts, 119089 and 16371, that added together give a triangular number (135460 = T520).
The spelling of 11908916371 in words is "eleven billion, nine hundred eight million, nine hundred sixteen thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •