Base | Representation |
---|---|
bin | 1001011110000110… |
… | …0010011010000100 |
3 | 20120011111122222212 |
4 | 2113201202122010 |
5 | 20201242320200 |
6 | 1100131042552 |
7 | 116665633553 |
oct | 22741423204 |
9 | 6504448885 |
10 | 2542151300 |
11 | 1094a83997 |
12 | 5ab440458 |
13 | 31689a250 |
14 | 1a18a3d9a |
15 | ed2a5035 |
hex | 97862684 |
2542151300 has 36 divisors (see below), whose sum is σ = 5940815076. Its totient is φ = 938640000.
The previous prime is 2542151299. The next prime is 2542151323. The reversal of 2542151300 is 31512452.
It can be written as a sum of positive squares in 6 ways, for example, as 520569856 + 2021581444 = 22816^2 + 44962^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 976451 + ... + 979050.
It is an arithmetic number, because the mean of its divisors is an integer number (165022641).
Almost surely, 22542151300 is an apocalyptic number.
2542151300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2542151300 is an abundant number, since it is smaller than the sum of its proper divisors (3398663776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2542151300 is a wasteful number, since it uses less digits than its factorization.
2542151300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1955528 (or 1955521 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 2542151300 is about 50419.7510902226. The cubic root of 2542151300 is about 1364.7940848755.
Adding to 2542151300 its reverse (31512452), we get a palindrome (2573663752).
The spelling of 2542151300 in words is "two billion, five hundred forty-two million, one hundred fifty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •