Base | Representation |
---|---|
bin | 1000110101001011… |
… | …11011100111000001 |
3 | 110020102020202202211 |
4 | 10122211323213001 |
5 | 34202211242101 |
6 | 2102242342121 |
7 | 225326561425 |
oct | 43245734701 |
9 | 13212222684 |
10 | 4741118401 |
11 | 2013268478 |
12 | b0395a941 |
13 | 5a7329706 |
14 | 32d952b85 |
15 | 1cb36ac51 |
hex | 11a97b9c1 |
4741118401 has 4 divisors (see below), whose sum is σ = 4821476400. Its totient is φ = 4660760404.
The previous prime is 4741118399. The next prime is 4741118419. The reversal of 4741118401 is 1048111474.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4741118401 - 21 = 4741118399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4741118441) 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 3 ways as a sum of consecutive naturals, for example, 40178911 + ... + 40179028.
It is an arithmetic number, because the mean of its divisors is an integer number (1205369100).
Almost surely, 24741118401 is an apocalyptic number.
It is an amenable number.
4741118401 is a deficient number, since it is larger than the sum of its proper divisors (80357999).
4741118401 is an equidigital number, since it uses as much as digits as its factorization.
4741118401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80357998.
The product of its (nonzero) digits is 3584, while the sum is 31.
The square root of 4741118401 is about 68855.7797210953. The cubic root of 4741118401 is about 1679.9393403315.
Adding to 4741118401 its reverse (1048111474), we get a palindrome (5789229875).
The spelling of 4741118401 in words is "four billion, seven hundred forty-one million, one hundred eighteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •