Base | Representation |
---|---|
bin | 111100111101111… |
… | …1011011001000100 |
3 | 12021120110000101221 |
4 | 1321323323121010 |
5 | 13142203043100 |
6 | 534555330124 |
7 | 101460420112 |
oct | 17173733104 |
9 | 5246400357 |
10 | 2045752900 |
11 | 95a857484 |
12 | 491150944 |
13 | 267aa6599 |
14 | 1559a8ab2 |
15 | be8ee01a |
hex | 79efb644 |
2045752900 has 27 divisors (see below), whose sum is σ = 4440265501. Its totient is φ = 818120240.
The previous prime is 2045752867. The next prime is 2045752901. The reversal of 2045752900 is 92575402.
The square root of 2045752900 is 45230.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 736471044 + 1309281856 = 27138^2 + 36184^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2045752901) 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 8 ways as a sum of consecutive naturals, for example, 450039 + ... + 454561.
Almost surely, 22045752900 is an apocalyptic number.
2045752900 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
2045752900 is the 45230-th square number.
It is an amenable number.
2045752900 is an abundant number, since it is smaller than the sum of its proper divisors (2394512601).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2045752900 is an frugal number, since it uses more digits than its factorization.
2045752900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9060 (or 4530 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 34.
The cubic root of 2045752900 is about 1269.4562121073.
The spelling of 2045752900 in words is "two billion, forty-five million, seven hundred fifty-two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •