Base | Representation |
---|---|
bin | 110000101110110001000000… |
… | …1000110011111110110000000 |
3 | 2002012200120111202211000220100 |
4 | 1201131202001012133312000 |
5 | 422140314004414324320 |
6 | 4115350241432042400 |
7 | 156200132235065160 |
oct | 14135420106376600 |
9 | 2065616452730810 |
10 | 428639902104960 |
11 | 11463a186134507 |
12 | 400a934bb33400 |
13 | 15523752a7b020 |
14 | 77bc3d39925a0 |
15 | 3484d92d93790 |
hex | 185d88119fd80 |
428639902104960 has 384 divisors, whose sum is σ = 1821719586173760. Its totient is φ = 90438308904960.
The previous prime is 428639902104851. The next prime is 428639902104977. The reversal of 428639902104960 is 69401209936824.
428639902104960 is a `hidden beast` number, since 4 + 2 + 8 + 6 + 39 + 90 + 21 + 0 + 496 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 408358531 + ... + 409406850.
Almost surely, 2428639902104960 is an apocalyptic number.
428639902104960 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
428639902104960 is an abundant number, since it is smaller than the sum of its proper divisors (1393079684068800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
428639902104960 is a wasteful number, since it uses less digits than its factorization.
428639902104960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817765426 (or 817765411 counting only the distinct ones).
The product of its (nonzero) digits is 40310784, while the sum is 63.
The spelling of 428639902104960 in words is "four hundred twenty-eight trillion, six hundred thirty-nine billion, nine hundred two million, one hundred four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •