Base | Representation |
---|---|
bin | 111001011101010011110001… |
… | …001001110011010101011001 |
3 | 1020010202010221120010200002122 |
4 | 321131103301021303111121 |
5 | 231110240203334043243 |
6 | 2253242011545311025 |
7 | 104141112341345501 |
oct | 7135236111632531 |
9 | 1203663846120078 |
10 | 252702741706073 |
11 | 735786a38231aa |
12 | 24413598a95475 |
13 | ab009c670cb29 |
14 | 4658c41190a01 |
15 | 1e335a1806668 |
hex | e5d4f1273559 |
252702741706073 has 8 divisors (see below), whose sum is σ = 272782569758400. Its totient is φ = 233380643014288.
The previous prime is 252702741706039. The next prime is 252702741706097. The reversal of 252702741706073 is 370607147207252.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 252702741706073 - 226 = 252702674597209 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (252702741706273) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 189432339443 + ... + 189432340776.
It is an arithmetic number, because the mean of its divisors is an integer number (34097821219800).
Almost surely, 2252702741706073 is an apocalyptic number.
252702741706073 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
252702741706073 is a deficient number, since it is larger than the sum of its proper divisors (20079828052327).
252702741706073 is a wasteful number, since it uses less digits than its factorization.
252702741706073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378864680271.
The product of its (nonzero) digits is 6914880, while the sum is 53.
The spelling of 252702741706073 in words is "two hundred fifty-two trillion, seven hundred two billion, seven hundred forty-one million, seven hundred six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •