Base | Representation |
---|---|
bin | 111110101010100… |
… | …000010111010101 |
3 | 2201021021002122100 |
4 | 332222200113111 |
5 | 4123120030010 |
6 | 252153352313 |
7 | 35024105025 |
oct | 7652402725 |
9 | 2637232570 |
10 | 1051330005 |
11 | 49a4a2880 |
12 | 254108699 |
13 | 139a6ca7b |
14 | 9d8ada85 |
15 | 624702c0 |
hex | 3eaa05d5 |
1051330005 has 48 divisors (see below), whose sum is σ = 2034242496. Its totient is φ = 497871360.
The previous prime is 1051329989. The next prime is 1051330037. The reversal of 1051330005 is 5000331501.
It is a happy number.
It is not a de Polignac number, because 1051330005 - 24 = 1051329989 is a prime.
It is a super-2 number, since 2×10513300052 = 2210589558826600050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1051330005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3412 + ... + 45981.
It is an arithmetic number, because the mean of its divisors is an integer number (42380052).
Almost surely, 21051330005 is an apocalyptic number.
1051330005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1051330005 is a deficient number, since it is larger than the sum of its proper divisors (982912491).
1051330005 is a wasteful number, since it uses less digits than its factorization.
1051330005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49458 (or 49455 counting only the distinct ones).
The product of its (nonzero) digits is 225, while the sum is 18.
The square root of 1051330005 is about 32424.2194200570. The cubic root of 1051330005 is about 1016.8253224880.
Adding to 1051330005 its reverse (5000331501), we get a palindrome (6051661506).
The spelling of 1051330005 in words is "one billion, fifty-one million, three hundred thirty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •