Base | Representation |
---|---|
bin | 100011001111110110… |
… | …0111010100000110100 |
3 | 21020101020020012202222 |
4 | 1012133230322200310 |
5 | 2220010102423010 |
6 | 54435004421512 |
7 | 5316522434120 |
oct | 1063754724064 |
9 | 236336205688 |
10 | 75693795380 |
11 | 2a1131a0895 |
12 | 12805847898 |
13 | 71a3c52448 |
14 | 3940cb8580 |
15 | 1e80411355 |
hex | 119fb3a834 |
75693795380 has 96 divisors (see below), whose sum is σ = 185208446976. Its totient is φ = 25449469056.
The previous prime is 75693795377. The next prime is 75693795403. The reversal of 75693795380 is 8359739657.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2073647 + ... + 2109833.
It is an arithmetic number, because the mean of its divisors is an integer number (1929254656).
Almost surely, 275693795380 is an apocalyptic number.
75693795380 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 75693795380, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92604223488).
75693795380 is an abundant number, since it is smaller than the sum of its proper divisors (109514651596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75693795380 is a wasteful number, since it uses less digits than its factorization.
75693795380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36493 (or 36491 counting only the distinct ones).
The product of its (nonzero) digits is 42865200, while the sum is 62.
The spelling of 75693795380 in words is "seventy-five billion, six hundred ninety-three million, seven hundred ninety-five thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •