Base | Representation |
---|---|
bin | 1001011100010111… |
… | …0001000000100000 |
3 | 20112122210210101210 |
4 | 2113011301000200 |
5 | 20142411333242 |
6 | 1055311030120 |
7 | 116550022446 |
oct | 22705610040 |
9 | 6478723353 |
10 | 2534871072 |
11 | 1090961178 |
12 | 5a8b0b340 |
13 | 31521b616 |
14 | 1a092ab96 |
15 | ec817d9c |
hex | 97171020 |
2534871072 has 48 divisors (see below), whose sum is σ = 6662839680. Its totient is φ = 843839232.
The previous prime is 2534871061. The next prime is 2534871083. The reversal of 2534871072 is 2701784352.
It is an interprime number because it is at equal distance from previous prime (2534871061) and next prime (2534871083).
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 2534871072.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57129 + ... + 91287.
It is an arithmetic number, because the mean of its divisors is an integer number (138809160).
Almost surely, 22534871072 is an apocalyptic number.
It is an amenable number.
2534871072 is an abundant number, since it is smaller than the sum of its proper divisors (4127968608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2534871072 is a wasteful number, since it uses less digits than its factorization.
2534871072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34945 (or 34937 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 39.
The square root of 2534871072 is about 50347.5031357067. The cubic root of 2534871072 is about 1363.4900040671.
The spelling of 2534871072 in words is "two billion, five hundred thirty-four million, eight hundred seventy-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •