Base | Representation |
---|---|
bin | 10011001100001011… |
… | …11100100110011001 |
3 | 222121000110220212211 |
4 | 21212011330212121 |
5 | 132100002111221 |
6 | 4422200035121 |
7 | 513212045020 |
oct | 114605744631 |
9 | 28530426784 |
10 | 10302769561 |
11 | 4407710297 |
12 | 1bb6462aa1 |
13 | c82647a66 |
14 | 6da4578b7 |
15 | 4047676e1 |
hex | 26617c999 |
10302769561 has 16 divisors (see below), whose sum is σ = 12035358720. Its totient is φ = 8635692240.
The previous prime is 10302769553. The next prime is 10302769613. The reversal of 10302769561 is 16596720301.
10302769561 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 10302769561 - 23 = 10302769553 is a prime.
It is a super-2 number, since 2×103027695612 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10302769511) 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, 392280 + ... + 417718.
It is an arithmetic number, because the mean of its divisors is an integer number (752209920).
Almost surely, 210302769561 is an apocalyptic number.
It is an amenable number.
10302769561 is a deficient number, since it is larger than the sum of its proper divisors (1732589159).
10302769561 is a wasteful number, since it uses less digits than its factorization.
10302769561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26724.
The product of its (nonzero) digits is 68040, while the sum is 40.
The spelling of 10302769561 in words is "ten billion, three hundred two million, seven hundred sixty-nine thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •