Base | Representation |
---|---|
bin | 111011111010100… |
… | …111000100001001 |
3 | 2121001111110202021 |
4 | 323322213010021 |
5 | 4024314020410 |
6 | 243425204441 |
7 | 33624141601 |
oct | 7372470411 |
9 | 2531443667 |
10 | 1005220105 |
11 | 47646981a |
12 | 240790721 |
13 | 1303471c6 |
14 | 97709c01 |
15 | 5d3b2eda |
hex | 3bea7109 |
1005220105 has 8 divisors (see below), whose sum is σ = 1245176064. Its totient is φ = 778234800.
The previous prime is 1005220103. The next prime is 1005220123. The reversal of 1005220105 is 5010225001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1005220105 - 21 = 1005220103 is a prime.
It is a super-2 number, since 2×10052201052 = 2020934918992422050, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1005220103) 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, 3242491 + ... + 3242800.
It is an arithmetic number, because the mean of its divisors is an integer number (155647008).
Almost surely, 21005220105 is an apocalyptic number.
It is an amenable number.
1005220105 is a deficient number, since it is larger than the sum of its proper divisors (239955959).
1005220105 is an equidigital number, since it uses as much as digits as its factorization.
1005220105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6485327.
The product of its (nonzero) digits is 100, while the sum is 16.
The square root of 1005220105 is about 31705.2062759415. The cubic root of 1005220105 is about 1001.7370160283.
Adding to 1005220105 its reverse (5010225001), we get a palindrome (6015445106).
It can be divided in two parts, 10052 and 20105, that multiplied together give a triangular number (202095460 = T20104).
The spelling of 1005220105 in words is "one billion, five million, two hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •