Base | Representation |
---|---|
bin | 1010001000111111… |
… | …00110010001011011 |
3 | 112001102000222220012 |
4 | 11010133212101123 |
5 | 42122142214321 |
6 | 2300113552135 |
7 | 251624045123 |
oct | 50437462133 |
9 | 15042028805 |
10 | 5444101211 |
11 | 23440648aa |
12 | 107b27564b |
13 | 689b71683 |
14 | 399065c83 |
15 | 21ce2c05b |
hex | 1447e645b |
5444101211 has 4 divisors (see below), whose sum is σ = 5460256152. Its totient is φ = 5427946272.
The previous prime is 5444101163. The next prime is 5444101213. The reversal of 5444101211 is 1121014445.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5444101211 is a prime.
It is a super-2 number, since 2×54441012112 = 59276475991223333042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5444101213) 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, 8076965 + ... + 8077638.
It is an arithmetic number, because the mean of its divisors is an integer number (1365064038).
Almost surely, 25444101211 is an apocalyptic number.
5444101211 is a deficient number, since it is larger than the sum of its proper divisors (16154941).
5444101211 is a wasteful number, since it uses less digits than its factorization.
5444101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16154940.
The product of its (nonzero) digits is 640, while the sum is 23.
The square root of 5444101211 is about 73784.1528446319. The cubic root of 5444101211 is about 1759.1737266230.
Adding to 5444101211 its reverse (1121014445), we get a palindrome (6565115656).
The spelling of 5444101211 in words is "five billion, four hundred forty-four million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •