Base | Representation |
---|---|
bin | 1001111000010110… |
… | …0001111110010000 |
3 | 20211211200021000111 |
4 | 2132011201332100 |
5 | 20412434000000 |
6 | 1115102531104 |
7 | 122503516201 |
oct | 23605417620 |
9 | 6754607014 |
10 | 2652250000 |
11 | 1141142754 |
12 | 620296a94 |
13 | 3336384ca |
14 | 1b23635a8 |
15 | 107ca1cba |
hex | 9e161f90 |
2652250000 has 105 divisors (see below), whose sum is σ = 6486303693. Its totient is φ = 1050600000.
The previous prime is 2652249979. The next prime is 2652250031. The reversal of 2652250000 is 522562.
The square root of 2652250000 is 51500.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 3 ways, for example, as 2323625616 + 328624384 = 48204^2 + 18128^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 25749949 + ... + 25750051.
Almost surely, 22652250000 is an apocalyptic number.
2652250000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
2652250000 is the 51500-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2652250000
2652250000 is an abundant number, since it is smaller than the sum of its proper divisors (3834053693).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2652250000 is an frugal number, since it uses more digits than its factorization.
2652250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244 (or 110 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 22.
The cubic root of 2652250000 is about 1384.2190421461.
Adding to 2652250000 its reverse (522562), we get a palindrome (2652772562).
The spelling of 2652250000 in words is "two billion, six hundred fifty-two million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •