Search a number
-
+
10111970 = 2511261137
BaseRepresentation
bin100110100100…
…101111100010
3201000202000102
4212210233202
510042040340
61000422402
7151643651
oct46445742
921022012
1010111970
115787300
123477a02
13213081b
1414b3198
15d4b215
hex9a4be2

10111970 has 48 divisors (see below), whose sum is σ = 20483064. Its totient is φ = 3590400.

The previous prime is 10111949. The next prime is 10111993. The reversal of 10111970 is 7911101.

10111970 is nontrivially palindromic in base 3 and base 9.

10111970 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 5697769 + 4414201 = 2387^2 + 2101^2 .

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73742 + ... + 73878.

Almost surely, 210111970 is an apocalyptic number.

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

10111970 is an abundant number, since it is smaller than the sum of its proper divisors (10371094).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

10111970 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 227 (or 216 counting only the distinct ones).

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

The square root of 10111970 is about 3179.9323892184. The cubic root of 10111970 is about 216.2445931801.

The spelling of 10111970 in words is "ten million, one hundred eleven thousand, nine hundred seventy".

Divisors: 1 2 5 10 11 22 55 61 110 121 122 137 242 274 305 605 610 671 685 1210 1342 1370 1507 3014 3355 6710 7381 7535 8357 14762 15070 16577 16714 33154 36905 41785 73810 82885 83570 91927 165770 183854 459635 919270 1011197 2022394 5055985 10111970