Base | Representation |
---|---|
bin | 1011010111011101… |
… | …1110110000101101 |
3 | 21212122102000222122 |
4 | 2311313132300231 |
5 | 22222103020023 |
6 | 1222434122325 |
7 | 135416641112 |
oct | 26567366055 |
9 | 7778360878 |
10 | 3051220013 |
11 | 1326374836 |
12 | 711a203a5 |
13 | 3981a903a |
14 | 20d33a909 |
15 | 12cd102c8 |
hex | b5ddec2d |
3051220013 has 6 divisors (see below), whose sum is σ = 3220263054. Its totient is φ = 2890629144.
The previous prime is 3051219973. The next prime is 3051220031. The reversal of 3051220013 is 3100221503.
It can be written as a sum of positive squares in only one way, i.e., 2635590244 + 415629769 = 51338^2 + 20387^2 .
It is not a de Polignac number, because 3051220013 - 212 = 3051215917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3051219973 and 3051220000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3051223013) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4225706 + ... + 4226427.
It is an arithmetic number, because the mean of its divisors is an integer number (536710509).
Almost surely, 23051220013 is an apocalyptic number.
It is an amenable number.
3051220013 is a deficient number, since it is larger than the sum of its proper divisors (169043041).
3051220013 is an equidigital number, since it uses as much as digits as its factorization.
3051220013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8452171 (or 8452152 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 3051220013 is about 55237.8494603112. The cubic root of 3051220013 is about 1450.4113003646.
Adding to 3051220013 its reverse (3100221503), we get a palindrome (6151441516).
The spelling of 3051220013 in words is "three billion, fifty-one million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •