Base | Representation |
---|---|
bin | 10100110111010110… |
… | …10100110001000011 |
3 | 1001220200002101100222 |
4 | 22123223110301003 |
5 | 140420122312243 |
6 | 5051312333255 |
7 | 544406251235 |
oct | 123353246103 |
9 | 31820071328 |
10 | 11201760323 |
11 | 4829113366 |
12 | 220754422b |
13 | 1096979c60 |
14 | 7839d0255 |
15 | 458645168 |
hex | 29bad4c43 |
11201760323 has 16 divisors (see below), whose sum is σ = 12410010816. Its totient is φ = 10043948160.
The previous prime is 11201760319. The next prime is 11201760331. The reversal of 11201760323 is 32306710211.
11201760323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11201760323 - 22 = 11201760319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201760292 and 11201760301.
It is not an unprimeable number, because it can be changed into a prime (11201763323) 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, 275858 + ... + 313848.
It is an arithmetic number, because the mean of its divisors is an integer number (775625676).
Almost surely, 211201760323 is an apocalyptic number.
11201760323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11201760323 is a deficient number, since it is larger than the sum of its proper divisors (1208250493).
11201760323 is a wasteful number, since it uses less digits than its factorization.
11201760323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38654.
The product of its (nonzero) digits is 1512, while the sum is 26.
The spelling of 11201760323 in words is "eleven billion, two hundred one million, seven hundred sixty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •