Search a number
-
+
9141969 = 33047323
BaseRepresentation
bin100010110111…
…111011010001
3122012110102110
4202313323101
54320020334
6523535533
7140463654
oct42677321
918173373
109141969
115184551
12308a5a9
131b81165
1412dd89b
15c08ae9
hex8b7ed1

9141969 has 4 divisors (see below), whose sum is σ = 12189296. Its totient is φ = 6094644.

The previous prime is 9141961. The next prime is 9142013. The reversal of 9141969 is 9691419.

9141969 is nontrivially palindromic in base 2.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 9141969 - 23 = 9141961 is a prime.

It is a super-2 number, since 2×91419692 = 167151194393922, which contains 22 as substring.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1523659 + ... + 1523664.

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

Almost surely, 29141969 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3047326.

The product of its digits is 17496, while the sum is 39.

The square root of 9141969 is about 3023.5689176865. The cubic root of 9141969 is about 209.0964124060.

It can be divided in two parts, 9 and 141969, that multiplied together give a palindrome (1277721).

The spelling of 9141969 in words is "nine million, one hundred forty-one thousand, nine hundred sixty-nine".

Divisors: 1 3 3047323 9141969