Base | Representation |
---|---|
bin | 1100011011101100000… |
… | …00101000111011100000 |
3 | 1111211122000121211020120 |
4 | 12031312000220323200 |
5 | 23444332000011230 |
6 | 524124453040240 |
7 | 42601650020031 |
oct | 6156600507340 |
9 | 1454560554216 |
10 | 427181641440 |
11 | 155191999984 |
12 | 6a95a326080 |
13 | 3138ab48c48 |
14 | 169661a8a88 |
15 | b1a2dad310 |
hex | 6376028ee0 |
427181641440 has 48 divisors (see below), whose sum is σ = 1345622172048. Its totient is φ = 113915104256.
The previous prime is 427181641417. The next prime is 427181641477. The reversal of 427181641440 is 44146181724.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 427181641392 and 427181641401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 444980397 + ... + 444981356.
It is an arithmetic number, because the mean of its divisors is an integer number (28033795251).
Almost surely, 2427181641440 is an apocalyptic number.
427181641440 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
427181641440 is an abundant number, since it is smaller than the sum of its proper divisors (918440530608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
427181641440 is a wasteful number, since it uses less digits than its factorization.
427181641440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889961771 (or 889961763 counting only the distinct ones).
The product of its (nonzero) digits is 172032, while the sum is 42.
The spelling of 427181641440 in words is "four hundred twenty-seven billion, one hundred eighty-one million, six hundred forty-one thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •