Search a number
-
+
10333110161 = 1110727293217
BaseRepresentation
bin10011001111110011…
…01011111110010001
3222200010120101100202
421213321223332101
5132130234011121
64425202224545
7514030662413
oct114771537621
928603511322
1010333110161
114422853670
122004655155
13c88a0ba8a
147004b49b3
1540725c40b
hex267e6bf91

10333110161 has 16 divisors (see below), whose sum is σ = 11385541440. Its totient is φ = 9299642880.

The previous prime is 10333110133. The next prime is 10333110163. The reversal of 10333110161 is 16101133301.

It is a happy number.

It is not a de Polignac number, because 10333110161 - 214 = 10333093777 is a prime.

It is a super-2 number, since 2×103331101612 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10333110163) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3210425 + ... + 3213641.

It is an arithmetic number, because the mean of its divisors is an integer number (711596340).

Almost surely, 210333110161 is an apocalyptic number.

10333110161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

10333110161 is a deficient number, since it is larger than the sum of its proper divisors (1052431279).

10333110161 is a wasteful number, since it uses less digits than its factorization.

10333110161 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 6064.

The product of its (nonzero) digits is 162, while the sum is 20.

Adding to 10333110161 its reverse (16101133301), we get a palindrome (26434243462).

The spelling of 10333110161 in words is "ten billion, three hundred thirty-three million, one hundred ten thousand, one hundred sixty-one".

Divisors: 1 11 107 1177 2729 3217 30019 35387 292003 344219 3212033 3786409 8779193 96571123 939373651 10333110161