Base | Representation |
---|---|
bin | 1100011100101111101… |
… | …00001111100001001000 |
3 | 1111220002112212022210121 |
4 | 12032113310033201020 |
5 | 24002012144120333 |
6 | 524301033353024 |
7 | 42622004645014 |
oct | 6162764174110 |
9 | 1456075768717 |
10 | 427748816968 |
11 | 155453068290 |
12 | 6aa98268774 |
13 | 3144b4c1075 |
14 | 169bb649544 |
15 | b1d7a9532d |
hex | 6397d0f848 |
427748816968 has 64 divisors (see below), whose sum is σ = 890010000000. Its totient is φ = 191087769600.
The previous prime is 427748816959. The next prime is 427748816983. The reversal of 427748816968 is 869618847724.
It is a junction number, because it is equal to n+sod(n) for n = 427748816897 and 427748816906.
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 15 ways as a sum of consecutive naturals, for example, 6672733 + ... + 6736531.
It is an arithmetic number, because the mean of its divisors is an integer number (13906406250).
Almost surely, 2427748816968 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 427748816968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (445005000000).
427748816968 is an abundant number, since it is smaller than the sum of its proper divisors (462261183032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
427748816968 is a wasteful number, since it uses less digits than its factorization.
427748816968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65126 (or 65122 counting only the distinct ones).
The product of its digits is 260112384, while the sum is 70.
The spelling of 427748816968 in words is "four hundred twenty-seven billion, seven hundred forty-eight million, eight hundred sixteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •