Base | Representation |
---|---|
bin | 111011111010100… |
… | …111000011100111 |
3 | 2121001111110201000 |
4 | 323322213003213 |
5 | 4024314020241 |
6 | 243425204343 |
7 | 33624141522 |
oct | 7372470347 |
9 | 2531443630 |
10 | 1005220071 |
11 | 476469799 |
12 | 2407906b3 |
13 | 13034719b |
14 | 97709bb9 |
15 | 5d3b2eb6 |
hex | 3bea70e7 |
1005220071 has 8 divisors (see below), whose sum is σ = 1489214960. Its totient is φ = 670146696.
The previous prime is 1005220057. The next prime is 1005220091. The reversal of 1005220071 is 1700225001.
It is not a de Polignac number, because 1005220071 - 25 = 1005220039 is a prime.
It is a super-3 number, since 3×10052200713 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1005220091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18615160 + ... + 18615213.
It is an arithmetic number, because the mean of its divisors is an integer number (186151870).
Almost surely, 21005220071 is an apocalyptic number.
1005220071 is a deficient number, since it is larger than the sum of its proper divisors (483994889).
1005220071 is an equidigital number, since it uses as much as digits as its factorization.
1005220071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37230382 (or 37230376 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 1005220071 is about 31705.2057397520. The cubic root of 1005220071 is about 1001.7370047343.
Adding to 1005220071 its reverse (1700225001), we get a palindrome (2705445072).
The spelling of 1005220071 in words is "one billion, five million, two hundred twenty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •