Base | Representation |
---|---|
bin | 1111011100000001… |
… | …0001100111011001 |
3 | 101200210202021100211 |
4 | 3313000101213121 |
5 | 31441333411010 |
6 | 1523113131121 |
7 | 204456540256 |
oct | 36700214731 |
9 | 11623667324 |
10 | 4144044505 |
11 | 1837228a77 |
12 | 9779b9aa1 |
13 | 510716953 |
14 | 2b452c42d |
15 | 193c2a08a |
hex | f70119d9 |
4144044505 has 8 divisors (see below), whose sum is σ = 5133268224. Its totient is φ = 3208292400.
The previous prime is 4144044503. The next prime is 4144044517. The reversal of 4144044505 is 5054404414.
4144044505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4144044505 - 21 = 4144044503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4144044503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13367731 + ... + 13368040.
It is an arithmetic number, because the mean of its divisors is an integer number (641658528).
Almost surely, 24144044505 is an apocalyptic number.
It is an amenable number.
4144044505 is a deficient number, since it is larger than the sum of its proper divisors (989223719).
4144044505 is a wasteful number, since it uses less digits than its factorization.
4144044505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26735807.
The product of its (nonzero) digits is 25600, while the sum is 31.
The square root of 4144044505 is about 64374.2534325642. The cubic root of 4144044505 is about 1606.2314937181.
Adding to 4144044505 its reverse (5054404414), we get a palindrome (9198448919).
The spelling of 4144044505 in words is "four billion, one hundred forty-four million, forty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •