Base | Representation |
---|---|
bin | 1011100011001000… |
… | …0011110110010001 |
3 | 22000001102221211202 |
4 | 2320302003312101 |
5 | 22322113140310 |
6 | 1231342320545 |
7 | 136552450640 |
oct | 27062036621 |
9 | 8001387752 |
10 | 3100130705 |
11 | 1350a410a1 |
12 | 726289155 |
13 | 3a5372689 |
14 | 215a2d357 |
15 | 1322723a5 |
hex | b8c83d91 |
3100130705 has 32 divisors (see below), whose sum is σ = 4300072704. Its totient is φ = 2101671936.
The previous prime is 3100130701. The next prime is 3100130753. The reversal of 3100130705 is 5070310013.
It is a happy number.
It is not a de Polignac number, because 3100130705 - 22 = 3100130701 is a prime.
It is a super-2 number, since 2×31001307052 = 19221620776167594050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3100130701) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2162669 + ... + 2164101.
It is an arithmetic number, because the mean of its divisors is an integer number (134377272).
Almost surely, 23100130705 is an apocalyptic number.
3100130705 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3100130705 is a deficient number, since it is larger than the sum of its proper divisors (1199941999).
3100130705 is a wasteful number, since it uses less digits than its factorization.
3100130705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2105.
The product of its (nonzero) digits is 315, while the sum is 20.
The square root of 3100130705 is about 55678.8173814782. The cubic root of 3100130705 is about 1458.1202281114.
Adding to 3100130705 its reverse (5070310013), we get a palindrome (8170440718).
The spelling of 3100130705 in words is "three billion, one hundred million, one hundred thirty thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •