Base | Representation |
---|---|
bin | 10111101110010111001111… |
… | …10000011010010001011000 |
3 | 20211201110100002121212220120 |
4 | 23313023213300122101120 |
5 | 23314230302104122012 |
6 | 302542454100353240 |
7 | 13663125064511310 |
oct | 1367134760322130 |
9 | 224643302555816 |
10 | 52170561004632 |
11 | 15694457670134 |
12 | 5a270073a5820 |
13 | 2315880205815 |
14 | cc50d6446440 |
15 | 60712185158c |
hex | 2f72e7c1a458 |
52170561004632 has 128 divisors (see below), whose sum is σ = 150019499535360. Its totient is φ = 14809950005760.
The previous prime is 52170561004621. The next prime is 52170561004663. The reversal of 52170561004632 is 23640016507125.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
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, 32451093 + ... + 34020795.
It is an arithmetic number, because the mean of its divisors is an integer number (1172027340120).
Almost surely, 252170561004632 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 52170561004632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75009749767680).
52170561004632 is an abundant number, since it is smaller than the sum of its proper divisors (97848938530728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52170561004632 is a wasteful number, since it uses less digits than its factorization.
52170561004632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1570993 (or 1570989 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 52170561004632 in words is "fifty-two trillion, one hundred seventy billion, five hundred sixty-one million, four thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •