Search a number
-
+
10101051 = 33616133
BaseRepresentation
bin100110100010…
…000100111011
3201000012001000
4212202010323
510041213201
61000300043
7151600062
oct46420473
921005030
1010101051
11577a084
123471623
13212886c
1414ad1d9
15d47d86
hex9a213b

10101051 has 16 divisors (see below), whose sum is σ = 15212320. Its totient is φ = 6622560.

The previous prime is 10101023. The next prime is 10101079. The reversal of 10101051 is 15010101.

It is an interprime number because it is at equal distance from previous prime (10101023) and next prime (10101079).

It is not a de Polignac number, because 10101051 - 29 = 10100539 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10101551) 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 15 ways as a sum of consecutive naturals, for example, 1420 + ... + 4713.

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

Almost surely, 210101051 is an apocalyptic number.

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

10101051 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 5, while the sum is 9.

The square root of 10101051 is about 3178.2150650955. The cubic root of 10101051 is about 216.1667308349.

Adding to 10101051 its reverse (15010101), we get a palindrome (25111152).

The spelling of 10101051 in words is "ten million, one hundred one thousand, fifty-one".

Divisors: 1 3 9 27 61 183 549 1647 6133 18399 55197 165591 374113 1122339 3367017 10101051