Base | Representation |
---|---|
bin | 1010100111101001… |
… | …10111010110000001 |
3 | 112201100001210111101 |
4 | 11103310313112001 |
5 | 43134020200101 |
6 | 2341423214401 |
7 | 261166354120 |
oct | 52364672601 |
9 | 15640053441 |
10 | 5701334401 |
11 | 2466288a14 |
12 | 1131447401 |
13 | 6cb247469 |
14 | 3c12a5ab7 |
15 | 2357de401 |
hex | 153d37581 |
5701334401 has 8 divisors (see below), whose sum is σ = 6516284544. Its totient is φ = 4886502720.
The previous prime is 5701334377. The next prime is 5701334423. The reversal of 5701334401 is 1044331075.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5701334401 - 27 = 5701334273 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5701334401.
It is not an unprimeable number, because it can be changed into a prime (5701334101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133236 + ... + 170746.
It is an arithmetic number, because the mean of its divisors is an integer number (814535568).
Almost surely, 25701334401 is an apocalyptic number.
It is an amenable number.
5701334401 is a deficient number, since it is larger than the sum of its proper divisors (814950143).
5701334401 is a wasteful number, since it uses less digits than its factorization.
5701334401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59231.
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 5701334401 is about 75507.1811220628. The cubic root of 5701334401 is about 1786.4553722610.
Adding to 5701334401 its reverse (1044331075), we get a palindrome (6745665476).
The spelling of 5701334401 in words is "five billion, seven hundred one million, three hundred thirty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •