Base | Representation |
---|---|
bin | 1110111001110001… |
… | …1110111001101101 |
3 | 101022210112121112002 |
4 | 3232130132321231 |
5 | 31143103202023 |
6 | 1500543222045 |
7 | 201064133036 |
oct | 35634367155 |
9 | 11283477462 |
10 | 4000444013 |
11 | 1773167885 |
12 | 9378a7925 |
13 | 4b9a48847 |
14 | 29d42ba8d |
15 | 186311b28 |
hex | ee71ee6d |
4000444013 has 2 divisors, whose sum is σ = 4000444014. Its totient is φ = 4000444012.
The previous prime is 4000444009. The next prime is 4000444031. The reversal of 4000444013 is 3104440004.
Together with next prime (4000444031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3255044809 + 745399204 = 57053^2 + 27302^2 .
It is a cyclic number.
It is not a de Polignac number, because 4000444013 - 22 = 4000444009 is a prime.
It is a super-2 number, since 2×40004440132 = 32007104602295088338, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4000444213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2000222006 + 2000222007.
It is an arithmetic number, because the mean of its divisors is an integer number (2000222007).
Almost surely, 24000444013 is an apocalyptic number.
It is an amenable number.
4000444013 is a deficient number, since it is larger than the sum of its proper divisors (1).
4000444013 is an equidigital number, since it uses as much as digits as its factorization.
4000444013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 4000444013 is about 63249.0633369380. The cubic root of 4000444013 is about 1587.4597853537.
Adding to 4000444013 its reverse (3104440004), we get a palindrome (7104884017).
The spelling of 4000444013 in words is "four billion, four hundred forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •