Base | Representation |
---|---|
bin | 111100011101110… |
… | …011000100001101 |
3 | 2121200212002222011 |
4 | 330131303010031 |
5 | 4034144204201 |
6 | 244355021221 |
7 | 34065430363 |
oct | 7435630415 |
9 | 2550762864 |
10 | 1014444301 |
11 | 48069a022 |
12 | 24389a811 |
13 | 132226900 |
14 | 98a2b633 |
15 | 5e0d6151 |
hex | 3c77310d |
1014444301 has 6 divisors (see below), whose sum is σ = 1098481290. Its totient is φ = 936409968.
The previous prime is 1014444283. The next prime is 1014444329. The reversal of 1014444301 is 1034444101.
It can be written as a sum of positive squares in 3 ways, for example, as 1550025 + 1012894276 = 1245^2 + 31826^2 .
It is not a de Polignac number, because 1014444301 - 27 = 1014444173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014444391) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3001146 + ... + 3001483.
It is an arithmetic number, because the mean of its divisors is an integer number (183080215).
Almost surely, 21014444301 is an apocalyptic number.
It is an amenable number.
1014444301 is a deficient number, since it is larger than the sum of its proper divisors (84036989).
1014444301 is an equidigital number, since it uses as much as digits as its factorization.
1014444301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6002655 (or 6002642 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 1014444301 is about 31850.3422430592. The cubic root of 1014444301 is about 1004.7917692725.
Adding to 1014444301 its reverse (1034444101), we get a palindrome (2048888402).
It can be divided in two parts, 10144 and 44301, that added together give a palindrome (54445).
The spelling of 1014444301 in words is "one billion, fourteen million, four hundred forty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •