Base | Representation |
---|---|
bin | 1100100000011000100110… |
… | …11101101000001001111000 |
3 | 10121101001220010022200020221 |
4 | 12100030103131220021320 |
5 | 12101034023021130130 |
6 | 134253441434025424 |
7 | 5535611320103425 |
oct | 620142335501170 |
9 | 117331803280227 |
10 | 27501002130040 |
11 | 8843122830a1a |
12 | 3101a65b78274 |
13 | 124644456198a |
14 | 6b10ac81ad4c |
15 | 32a56e16a87a |
hex | 190313768278 |
27501002130040 has 32 divisors (see below), whose sum is σ = 62478004848480. Its totient is φ = 10893600842112.
The previous prime is 27501002129989. The next prime is 27501002130157. The reversal of 27501002130040 is 4003120010572.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 27501002129987 and 27501002130014.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 3337496139 + ... + 3337504378.
It is an arithmetic number, because the mean of its divisors is an integer number (1952437651515).
Almost surely, 227501002130040 is an apocalyptic number.
27501002130040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27501002130040 is an abundant number, since it is smaller than the sum of its proper divisors (34977002718440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27501002130040 is a wasteful number, since it uses less digits than its factorization.
27501002130040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6675000631 (or 6675000627 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 25.
The spelling of 27501002130040 in words is "twenty-seven trillion, five hundred one billion, two million, one hundred thirty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •