Base | Representation |
---|---|
bin | 10000101000000011000001… |
… | …110110001000101101100100 |
3 | 100120220021111120012011011112 |
4 | 100220003001312020231210 |
5 | 34041002322003110002 |
6 | 415303115343524152 |
7 | 21254541660142160 |
oct | 2050030166105544 |
9 | 316807446164145 |
10 | 73120775441252 |
11 | 2133138a533460 |
12 | 824b3678b9658 |
13 | 31a534b285736 |
14 | 140b0c8a79ca0 |
15 | 86c08c315852 |
hex | 4280c1d88b64 |
73120775441252 has 48 divisors (see below), whose sum is σ = 159742623664512. Its totient is φ = 28451759105280.
The previous prime is 73120775441123. The next prime is 73120775441269. The reversal of 73120775441252 is 25214457702137.
It is a super-2 number, since 2×731207754412522 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 73120775441252.
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 15 ways as a sum of consecutive naturals, for example, 153322793 + ... + 153798960.
It is an arithmetic number, because the mean of its divisors is an integer number (3327971326344).
Almost surely, 273120775441252 is an apocalyptic number.
It is an amenable number.
73120775441252 is an abundant number, since it is smaller than the sum of its proper divisors (86621848223260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
73120775441252 is a wasteful number, since it uses less digits than its factorization.
73120775441252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307122548 (or 307122546 counting only the distinct ones).
The product of its (nonzero) digits is 3292800, while the sum is 50.
The spelling of 73120775441252 in words is "seventy-three trillion, one hundred twenty billion, seven hundred seventy-five million, four hundred forty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •