Base | Representation |
---|---|
bin | 111101101010000… |
… | …0011000100110110 |
3 | 12100011220121211220 |
4 | 1323110003010312 |
5 | 13214111244141 |
6 | 541142411210 |
7 | 102160650351 |
oct | 17324030466 |
9 | 5304817756 |
10 | 2068853046 |
11 | 9718a4a07 |
12 | 498a30b06 |
13 | 26c803b00 |
14 | 158a9d298 |
15 | c1963766 |
hex | 7b503136 |
2068853046 has 48 divisors (see below), whose sum is σ = 4744071504. Its totient is φ = 599119872.
The previous prime is 2068853041. The next prime is 2068853051. The reversal of 2068853046 is 6403588602.
It is an interprime number because it is at equal distance from previous prime (2068853041) and next prime (2068853051).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2068852989 and 2068853007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2068853041) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42771 + ... + 77246.
It is an arithmetic number, because the mean of its divisors is an integer number (98834823).
Almost surely, 22068853046 is an apocalyptic number.
2068853046 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
2068853046 is an abundant number, since it is smaller than the sum of its proper divisors (2675218458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2068853046 is a wasteful number, since it uses less digits than its factorization.
2068853046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120065 (or 120052 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 42.
The square root of 2068853046 is about 45484.6462666250. The cubic root of 2068853046 is about 1274.2164702276.
The spelling of 2068853046 in words is "two billion, sixty-eight million, eight hundred fifty-three thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •