Base | Representation |
---|---|
bin | 1001011001010101… |
… | …11100000111011001 |
3 | 111000112222010211102 |
4 | 10230222330013121 |
5 | 40312332433311 |
6 | 2152315241145 |
7 | 236001605000 |
oct | 45452740731 |
9 | 14015863742 |
10 | 5044421081 |
11 | 2159498247 |
12 | b894491b5 |
13 | 62511285b |
14 | 35bd45c37 |
15 | 1e7ccd43b |
hex | 12cabc1d9 |
5044421081 has 16 divisors (see below), whose sum is σ = 5885798400. Its totient is φ = 4321517760.
The previous prime is 5044421071. The next prime is 5044421113. The reversal of 5044421081 is 1801244405.
It is not a de Polignac number, because 5044421081 - 222 = 5040226777 is a prime.
It is a super-2 number, since 2×50444210812 = 50892368084874417122, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5044421021) 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 15 ways as a sum of consecutive naturals, for example, 1160945 + ... + 1165281.
It is an arithmetic number, because the mean of its divisors is an integer number (367862400).
Almost surely, 25044421081 is an apocalyptic number.
It is an amenable number.
5044421081 is a deficient number, since it is larger than the sum of its proper divisors (841377319).
5044421081 is an equidigital number, since it uses as much as digits as its factorization.
5044421081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7749 (or 7735 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 29.
The square root of 5044421081 is about 71024.0880335679. The cubic root of 5044421081 is about 1715.0249559051.
Adding to 5044421081 its reverse (1801244405), we get a palindrome (6845665486).
The spelling of 5044421081 in words is "five billion, forty-four million, four hundred twenty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •