Base | Representation |
---|---|
bin | 1000111110100… |
… | …10110101010100 |
3 | 12020201021021200 |
4 | 10133102311110 |
5 | 123234444333 |
6 | 11250112500 |
7 | 1603100610 |
oct | 437226524 |
9 | 166637250 |
10 | 75312468 |
11 | 3956a410 |
12 | 2127b730 |
13 | 127ab8ba |
14 | a006340 |
15 | 6929c13 |
hex | 47d2d54 |
75312468 has 144 divisors (see below), whose sum is σ = 240589440. Its totient is φ = 19296000.
The previous prime is 75312451. The next prime is 75312481. The reversal of 75312468 is 86421357.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 279838 + ... + 280106.
It is an arithmetic number, because the mean of its divisors is an integer number (1670760).
Almost surely, 275312468 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 75312468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120294720).
75312468 is an abundant number, since it is smaller than the sum of its proper divisors (165276972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75312468 is a wasteful number, since it uses less digits than its factorization.
75312468 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398 (or 393 counting only the distinct ones).
The product of its digits is 40320, while the sum is 36.
The square root of 75312468 is about 8678.2756351708. The cubic root of 75312468 is about 422.3011783500.
Subtracting 75312468 from its reverse (86421357), we obtain a square (11108889 = 33332).
It can be divided in two parts, 7531 and 2468, that added together give a palindrome (9999).
The spelling of 75312468 in words is "seventy-five million, three hundred twelve thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •