Base | Representation |
---|---|
bin | 1001010110010110… |
… | …1000001010111100 |
3 | 20110220101101201122 |
4 | 2111211220022330 |
5 | 20114433402202 |
6 | 1053010530112 |
7 | 116122556252 |
oct | 22545501274 |
9 | 6426341648 |
10 | 2509669052 |
11 | 1078708560 |
12 | 5a0596938 |
13 | 30cc36497 |
14 | 19b44a5d2 |
15 | ea4da9a2 |
hex | 959682bc |
2509669052 has 12 divisors (see below), whose sum is σ = 4791186456. Its totient is φ = 1140758640.
The previous prime is 2509669051. The next prime is 2509669079.
2509669052 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (44), and also a Moran number because the ratio is a prime number: 57037933 = 2509669052 / (2 + 5 + 0 + 9 + 6 + 6 + 9 + 0 + 5 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 2509668994 and 2509669012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2509669051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28518923 + ... + 28519010.
It is an arithmetic number, because the mean of its divisors is an integer number (399265538).
Almost surely, 22509669052 is an apocalyptic number.
2509669052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2509669052 is a deficient number, since it is larger than the sum of its proper divisors (2281517404).
2509669052 is a wasteful number, since it uses less digits than its factorization.
2509669052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57037948 (or 57037946 counting only the distinct ones).
The product of its (nonzero) digits is 291600, while the sum is 44.
The square root of 2509669052 is about 50096.5972097906. The cubic root of 2509669052 is about 1358.9562803825.
The spelling of 2509669052 in words is "two billion, five hundred nine million, six hundred sixty-nine thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •