Base | Representation |
---|---|
bin | 1010000011111000… |
… | …11001000110001000 |
3 | 111221102112101001020 |
4 | 11001330121012020 |
5 | 42030214132033 |
6 | 2251544552440 |
7 | 250564305060 |
oct | 50174310610 |
9 | 14842471036 |
10 | 5401317768 |
11 | 23219a2a90 |
12 | 1068a82720 |
13 | 681041c22 |
14 | 3934ca3a0 |
15 | 2192ca6b3 |
hex | 141f19188 |
5401317768 has 128 divisors (see below), whose sum is σ = 17153233920. Its totient is φ = 1376444160.
The previous prime is 5401317751. The next prime is 5401317791. The reversal of 5401317768 is 8677131045.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 70371 + ... + 125517.
It is an arithmetic number, because the mean of its divisors is an integer number (134009640).
Almost surely, 25401317768 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 5401317768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8576616960).
5401317768 is an abundant number, since it is smaller than the sum of its proper divisors (11751916152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5401317768 is a wasteful number, since it uses less digits than its factorization.
5401317768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55227 (or 55223 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 42.
The square root of 5401317768 is about 73493.6580121033. The cubic root of 5401317768 is about 1754.5533415802.
The spelling of 5401317768 in words is "five billion, four hundred one million, three hundred seventeen thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •