Base | Representation |
---|---|
bin | 1011100011001001… |
… | …0101110000010101 |
3 | 22000001120200110100 |
4 | 2320302111300111 |
5 | 22322123012203 |
6 | 1231344044313 |
7 | 136553204532 |
oct | 27062256025 |
9 | 8001520410 |
10 | 3100204053 |
11 | 1350a91211 |
12 | 726303699 |
13 | 3a5399b8b |
14 | 215a4bd89 |
15 | 132288ea3 |
hex | b8c95c15 |
3100204053 has 12 divisors (see below), whose sum is σ = 4587294348. Its totient is φ = 2016392640.
The previous prime is 3100204043. The next prime is 3100204069. The reversal of 3100204053 is 3504020013.
It can be written as a sum of positive squares in 2 ways, for example, as 84217329 + 3015986724 = 9177^2 + 54918^2 .
It is not a de Polignac number, because 3100204053 - 25 = 3100204021 is a prime.
It is a super-2 number, since 2×31002040532 = 19222530340475253618, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3100204013) 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, 4200450 + ... + 4201187.
It is an arithmetic number, because the mean of its divisors is an integer number (382274529).
Almost surely, 23100204053 is an apocalyptic number.
It is an amenable number.
3100204053 is a deficient number, since it is larger than the sum of its proper divisors (1487090295).
3100204053 is a wasteful number, since it uses less digits than its factorization.
3100204053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8401684 (or 8401681 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
The square root of 3100204053 is about 55679.4760481813. The cubic root of 3100204053 is about 1458.1317275576.
Adding to 3100204053 its reverse (3504020013), we get a palindrome (6604224066).
The spelling of 3100204053 in words is "three billion, one hundred million, two hundred four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •