Base | Representation |
---|---|
bin | 100010011010010000… |
… | …1011000110100000010 |
3 | 21001201220122000102120 |
4 | 1010310201120310002 |
5 | 2202314234033100 |
6 | 53540331225110 |
7 | 5224126223010 |
oct | 1046441306402 |
9 | 231656560376 |
10 | 73895611650 |
11 | 29380167833 |
12 | 123a35a8196 |
13 | 6c78549cc3 |
14 | 38101558b0 |
15 | 1dc76160a0 |
hex | 1134858d02 |
73895611650 has 96 divisors (see below), whose sum is σ = 209491675008. Its totient is φ = 16886361600.
The previous prime is 73895611637. The next prime is 73895611697. The reversal of 73895611650 is 5611659837.
It is a super-2 number, since 2×738956116502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 73895611593 and 73895611602.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7682244 + ... + 7691856.
It is an arithmetic number, because the mean of its divisors is an integer number (2182204948).
Almost surely, 273895611650 is an apocalyptic number.
73895611650 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
73895611650 is an abundant number, since it is smaller than the sum of its proper divisors (135596063358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
73895611650 is a wasteful number, since it uses less digits than its factorization.
73895611650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16956 (or 16951 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 73895611650 in words is "seventy-three billion, eight hundred ninety-five million, six hundred eleven thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •