Base | Representation |
---|---|
bin | 10000101101010100011111… |
… | …001101100111000010111000 |
3 | 100122011220202220202122111220 |
4 | 100231110133031213002320 |
5 | 34112421411444110020 |
6 | 420141402350352040 |
7 | 21322660123520445 |
oct | 2055243715470270 |
9 | 318156686678456 |
10 | 73483119128760 |
11 | 2146101a057940 |
12 | 82a962babb620 |
13 | 3200575271763 |
14 | 142085da329cc |
15 | 8766e7d78240 |
hex | 42d51f3670b8 |
73483119128760 has 128 divisors (see below), whose sum is σ = 240495132360960. Its totient is φ = 17813724723200.
The previous prime is 73483119128681. The next prime is 73483119128779. The reversal of 73483119128760 is 6782191138437.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a junction number, because it is equal to n+sod(n) for n = 73483119128694 and 73483119128703.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66948544 + ... + 68037296.
It is an arithmetic number, because the mean of its divisors is an integer number (1878868221570).
Almost surely, 273483119128760 is an apocalyptic number.
It is an amenable number.
73483119128760 is an abundant number, since it is smaller than the sum of its proper divisors (167012013232200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
73483119128760 is a wasteful number, since it uses less digits than its factorization.
73483119128760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1139909 (or 1139905 counting only the distinct ones).
The product of its (nonzero) digits is 12192768, while the sum is 60.
The spelling of 73483119128760 in words is "seventy-three trillion, four hundred eighty-three billion, one hundred nineteen million, one hundred twenty-eight thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •