Base | Representation |
---|---|
bin | 111100101000110… |
… | …0111111100100001 |
3 | 12020210120121012100 |
4 | 1321101213330201 |
5 | 13131333210301 |
6 | 533521521013 |
7 | 101264231454 |
oct | 17121477441 |
9 | 5223517170 |
10 | 2034663201 |
11 | 95457263a |
12 | 4894a3169 |
13 | 2656c2a2c |
14 | 15431d49b |
15 | bd95d286 |
hex | 79467f21 |
2034663201 has 12 divisors (see below), whose sum is σ = 2939465620. Its totient is φ = 1356207840.
The previous prime is 2034663193. The next prime is 2034663209. The reversal of 2034663201 is 1023664302.
2034663201 is a `hidden beast` number, since 20 + 3 + 4 + 6 + 632 + 0 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (2034663193) and next prime (2034663209).
It can be written as a sum of positive squares in 2 ways, for example, as 368064225 + 1666598976 = 19185^2 + 40824^2 .
It is not a de Polignac number, because 2034663201 - 23 = 2034663193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2034663209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47631 + ... + 79611.
Almost surely, 22034663201 is an apocalyptic number.
It is an amenable number.
2034663201 is a deficient number, since it is larger than the sum of its proper divisors (904802419).
2034663201 is a wasteful number, since it uses less digits than its factorization.
2034663201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39056 (or 39053 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 2034663201 is about 45107.2411149252. The cubic root of 2034663201 is about 1267.1582150938.
The spelling of 2034663201 in words is "two billion, thirty-four million, six hundred sixty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •