Search a number
-
+
49021100001 = 3226572049977
BaseRepresentation
bin101101101001111000…
…101001111111100001
311200112100211220021100
4231221320221333201
51300343400200001
634304152145013
73353534321616
oct555170517741
9150470756240
1049021100001
1119876150a95
129601098169
13481300c863
14253071650d
15141d980586
hexb69e29fe1

49021100001 has 12 divisors (see below), whose sum is σ = 70834939812. Its totient is φ = 32668417536.

The previous prime is 49021099999. The next prime is 49021100027. The reversal of 49021100001 is 10000112094.

It can be written as a sum of positive squares in 2 ways, for example, as 40875134976 + 8145965025 = 202176^2 + 90255^2 .

It is not a de Polignac number, because 49021100001 - 21 = 49021099999 is a prime.

It is not an unprimeable number, because it can be changed into a prime (49021101001) 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, 1001076 + ... + 1048901.

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

Almost surely, 249021100001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 72, while the sum is 18.

Adding to 49021100001 its reverse (10000112094), we get a palindrome (59021212095).

The spelling of 49021100001 in words is "forty-nine billion, twenty-one million, one hundred thousand, one".

Divisors: 1 3 9 2657 7971 23913 2049977 6149931 18449793 5446788889 16340366667 49021100001