Base | Representation |
---|---|
bin | 1101110000110011001… |
… | …00110101110111011101 |
3 | 1200012120111122212122222 |
4 | 12320121210311313131 |
5 | 30221422111201111 |
6 | 1001122550515125 |
7 | 46110203231501 |
oct | 6703144656735 |
9 | 1605514585588 |
10 | 472875490781 |
11 | 1725aa983231 |
12 | 77791065aa5 |
13 | 35790724a15 |
14 | 18c5ca50301 |
15 | c4796a67db |
hex | 6e19935ddd |
472875490781 has 8 divisors (see below), whose sum is σ = 493551745344. Its totient is φ = 452208940480.
The previous prime is 472875490751. The next prime is 472875490799. The reversal of 472875490781 is 187094578274.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-472875490781 is a prime.
It is a super-2 number, since 2×4728754907812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (472875490751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2326391 + ... + 2521476.
It is an arithmetic number, because the mean of its divisors is an integer number (61693968168).
Almost surely, 2472875490781 is an apocalyptic number.
It is an amenable number.
472875490781 is a deficient number, since it is larger than the sum of its proper divisors (20676254563).
472875490781 is a wasteful number, since it uses less digits than its factorization.
472875490781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4852131.
The product of its (nonzero) digits is 31610880, while the sum is 62.
The spelling of 472875490781 in words is "four hundred seventy-two billion, eight hundred seventy-five million, four hundred ninety thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •