Base | Representation |
---|---|
bin | 1011100011010111… |
… | …0000111111100101 |
3 | 22000010021022021121 |
4 | 2320311300333211 |
5 | 22322340231203 |
6 | 1231415213541 |
7 | 136563634600 |
oct | 27065607745 |
9 | 8003238247 |
10 | 3101102053 |
11 | 1351544965 |
12 | 7266772b1 |
13 | 3a562283a |
14 | 215c03337 |
15 | 1323b50bd |
hex | b8d70fe5 |
3101102053 has 24 divisors (see below), whose sum is σ = 3737935512. Its totient is φ = 2563190784.
The previous prime is 3101102033. The next prime is 3101102071. The reversal of 3101102053 is 3502011013.
It can be written as a sum of positive squares in 4 ways, for example, as 358799364 + 2742302689 = 18942^2 + 52367^2 .
It is not a de Polignac number, because 3101102053 - 221 = 3099004901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3101102023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 197301 + ... + 212437.
It is an arithmetic number, because the mean of its divisors is an integer number (155747313).
Almost surely, 23101102053 is an apocalyptic number.
It is an amenable number.
3101102053 is a deficient number, since it is larger than the sum of its proper divisors (636833459).
3101102053 is a wasteful number, since it uses less digits than its factorization.
3101102053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15301 (or 15294 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 3101102053 is about 55687.5394769782. The cubic root of 3101102053 is about 1458.2725006447.
Adding to 3101102053 its reverse (3502011013), we get a palindrome (6603113066).
The spelling of 3101102053 in words is "three billion, one hundred one million, one hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •