Base | Representation |
---|---|
bin | 10111111111000001110110… |
… | …11111000000011110100000 |
3 | 20220202012102001002221002020 |
4 | 23333200323133000132200 |
5 | 23403121031233112130 |
6 | 304101520120021440 |
7 | 14052366401052636 |
oct | 1377407337003640 |
9 | 226665361087066 |
10 | 52743196379040 |
11 | 1589529a386482 |
12 | 5ab9b99901880 |
13 | 235787b77817b |
14 | d04ada291356 |
15 | 616e89111e10 |
hex | 2ff83b7c07a0 |
52743196379040 has 192 divisors, whose sum is σ = 174911605545600. Its totient is φ = 13322595446784.
The previous prime is 52743196379023. The next prime is 52743196379053. The reversal of 52743196379040 is 4097369134725.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 60755074 + ... + 61617086.
It is an arithmetic number, because the mean of its divisors is an integer number (910997945550).
Almost surely, 252743196379040 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52743196379040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87455802772800).
52743196379040 is an abundant number, since it is smaller than the sum of its proper divisors (122168409166560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52743196379040 is a wasteful number, since it uses less digits than its factorization.
52743196379040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 868759 (or 868751 counting only the distinct ones).
The product of its (nonzero) digits is 34292160, while the sum is 60.
The spelling of 52743196379040 in words is "fifty-two trillion, seven hundred forty-three billion, one hundred ninety-six million, three hundred seventy-nine thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •