Base | Representation |
---|---|
bin | 100100111000010100110… |
… | …110001111010110010000 |
3 | 22222021200022222021110110 |
4 | 210320110312033112100 |
5 | 313010402344430400 |
6 | 5220140041001320 |
7 | 351050211351012 |
oct | 44702466172620 |
9 | 8867608867413 |
10 | 2534380467600 |
11 | 897908780473 |
12 | 34b21aa83240 |
13 | 154cb645b8a7 |
14 | 8a943bd01b2 |
15 | 45dd20b5e50 |
hex | 24e14d8f590 |
2534380467600 has 60 divisors (see below), whose sum is σ = 8118465435056. Its totient is φ = 675834791040.
The previous prime is 2534380467571. The next prime is 2534380467613. The reversal of 2534380467600 is 67640834352.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 2534380467600.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1055990662 + ... + 1055993061.
Almost surely, 22534380467600 is an apocalyptic number.
2534380467600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2534380467600 is an abundant number, since it is smaller than the sum of its proper divisors (5584084967456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2534380467600 is a wasteful number, since it uses less digits than its factorization.
2534380467600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2111983744 (or 2111983733 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 48.
The spelling of 2534380467600 in words is "two trillion, five hundred thirty-four billion, three hundred eighty million, four hundred sixty-seven thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •