Base | Representation |
---|---|
bin | 100010010101010101… |
… | …0001100000101010101 |
3 | 21001022101021112010001 |
4 | 1010222222030011111 |
5 | 2201444404143040 |
6 | 53512100531301 |
7 | 5220046622521 |
oct | 1045252140525 |
9 | 231271245101 |
10 | 73730146645 |
11 | 292a58224a1 |
12 | 123580b0b31 |
13 | 6c50194c0c |
14 | 37d61a2d81 |
15 | 1db7d2e59a |
hex | 112aa8c155 |
73730146645 has 4 divisors (see below), whose sum is σ = 88476175980. Its totient is φ = 58984117312.
The previous prime is 73730146613. The next prime is 73730146681. The reversal of 73730146645 is 54664103737.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7731509041 + 65998637604 = 87929^2 + 256902^2 .
It is a cyclic number.
It is not a de Polignac number, because 73730146645 - 25 = 73730146613 is a prime.
It is a super-2 number, since 2×737301466452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 73730146595 and 73730146604.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7373014660 + ... + 7373014669.
It is an arithmetic number, because the mean of its divisors is an integer number (22119043995).
Almost surely, 273730146645 is an apocalyptic number.
It is an amenable number.
73730146645 is a deficient number, since it is larger than the sum of its proper divisors (14746029335).
73730146645 is a wasteful number, since it uses less digits than its factorization.
73730146645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14746029334.
The product of its (nonzero) digits is 1270080, while the sum is 46.
The spelling of 73730146645 in words is "seventy-three billion, seven hundred thirty million, one hundred forty-six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •