Base | Representation |
---|---|
bin | 1001000100001… |
… | …11101110001110 |
3 | 12022002220122020 |
4 | 10202013232032 |
5 | 123432202030 |
6 | 11314031010 |
7 | 1612305000 |
oct | 442075616 |
9 | 168086566 |
10 | 76053390 |
11 | 39a26046 |
12 | 21578466 |
13 | 129aac0a |
14 | a15a370 |
15 | 6a24510 |
hex | 4887b8e |
76053390 has 128 divisors (see below), whose sum is σ = 224640000. Its totient is φ = 16426368.
The previous prime is 76053377. The next prime is 76053391. The reversal of 76053390 is 9335067.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (76053391) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 195316 + ... + 195704.
It is an arithmetic number, because the mean of its divisors is an integer number (1755000).
Almost surely, 276053390 is an apocalyptic number.
76053390 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 76053390, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112320000).
76053390 is an abundant number, since it is smaller than the sum of its proper divisors (148586610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76053390 is a wasteful number, since it uses less digits than its factorization.
76053390 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439 (or 425 counting only the distinct ones).
The product of its (nonzero) digits is 17010, while the sum is 33.
The square root of 76053390 is about 8720.8594759920. The cubic root of 76053390 is about 423.6815240768.
The spelling of 76053390 in words is "seventy-six million, fifty-three thousand, three hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •