Search a number
-
+
10055947 = 112412027
BaseRepresentation
bin100110010111…
…000100001011
3200220220011111
4212113010023
510033242242
6555311151
7151321426
oct46270413
920826144
1010055947
115749200
12344b4b7
132111185
14149a9bd
15d39817
hex99710b

10055947 has 12 divisors (see below), whose sum is σ = 11328408. Its totient is φ = 8914400.

The previous prime is 10055933. The next prime is 10055951. The reversal of 10055947 is 74955001.

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

It is not a de Polignac number, because 10055947 - 27 = 10055819 is a prime.

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

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3948 + ... + 5974.

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

Almost surely, 210055947 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 6300, while the sum is 31.

The square root of 10055947 is about 3171.1113193958. Note that the first 3 decimals coincide. The cubic root of 10055947 is about 215.8445025683.

The spelling of 10055947 in words is "ten million, fifty-five thousand, nine hundred forty-seven".

Divisors: 1 11 41 121 451 2027 4961 22297 83107 245267 914177 10055947