Search a number
-
+
1010051001 = 32195906731
BaseRepresentation
bin111100001101000…
…010011110111001
32121101120220111100
4330031002132321
54032033113001
6244120522013
734013202051
oct7415023671
92541526440
101010051001
114791692a3
12242320309
1313134901b
1498206561
155da19586
hex3c3427b9

1010051001 has 12 divisors (see below), whose sum is σ = 1535750320. Its totient is φ = 637926840.

The previous prime is 1010050981. The next prime is 1010051023. The reversal of 1010051001 is 1001500101.

It is not a de Polignac number, because 1010051001 - 25 = 1010050969 is a prime.

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

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 (1010051101) by changing a digit.

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

Almost surely, 21010051001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 1010051001 is about 31781.2995486339. The cubic root of 1010051001 is about 1003.3391711918.

Adding to 1010051001 its reverse (1001500101), we get a palindrome (2011551102).

The spelling of 1010051001 in words is "one billion, ten million, fifty-one thousand, one".

Divisors: 1 3 9 19 57 171 5906731 17720193 53160579 112227889 336683667 1010051001