Base | Representation |
---|---|
bin | 1001110000000000… |
… | …01110011010000001 |
3 | 111111210201201020002 |
4 | 10320000032122001 |
5 | 41210021103101 |
6 | 2223230325345 |
7 | 243500641613 |
oct | 47000163201 |
9 | 14453651202 |
10 | 5234550401 |
11 | 2246849213 |
12 | 1021059855 |
13 | 655622102 |
14 | 3792b8db3 |
15 | 209837d6b |
hex | 13800e681 |
5234550401 has 8 divisors (see below), whose sum is σ = 5372778600. Its totient is φ = 5096824960.
The previous prime is 5234550383. The next prime is 5234550437. The reversal of 5234550401 is 1040554325.
It can be written as a sum of positive squares in 4 ways, for example, as 517608001 + 4716942400 = 22751^2 + 68680^2 .
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-5234550401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5234550301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104546 + ... + 146283.
It is an arithmetic number, because the mean of its divisors is an integer number (671597325).
Almost surely, 25234550401 is an apocalyptic number.
It is an amenable number.
5234550401 is a deficient number, since it is larger than the sum of its proper divisors (138228199).
5234550401 is a wasteful number, since it uses less digits than its factorization.
5234550401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251379.
The product of its (nonzero) digits is 12000, while the sum is 29.
The square root of 5234550401 is about 72350.1928193699. The cubic root of 5234550401 is about 1736.3067833003.
The spelling of 5234550401 in words is "five billion, two hundred thirty-four million, five hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •