Base | Representation |
---|---|
bin | 1001100011100000000011… |
… | …1001100101010011001101 |
3 | 1101012022112201021001221201 |
4 | 2120320000321211103031 |
5 | 2334110233301213010 |
6 | 34202055025425501 |
7 | 2132666131662055 |
oct | 230700071452315 |
9 | 41168481231851 |
10 | 10505505101005 |
11 | 33903a582a372 |
12 | 121805449b291 |
13 | 5b28849849c5 |
14 | 28467d536565 |
15 | 13341400223a |
hex | 98e00e654cd |
10505505101005 has 16 divisors (see below), whose sum is σ = 12640556113920. Its totient is φ = 8381774347648.
The previous prime is 10505505100939. The next prime is 10505505101009. The reversal of 10505505101005 is 50010150550501.
It is a cyclic number.
It is not a de Polignac number, because 10505505101005 - 219 = 10505504576717 is a prime.
It is a super-2 number, since 2×105055051010052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10505505101009) 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 15 ways as a sum of consecutive naturals, for example, 23851404 + ... + 24287866.
It is an arithmetic number, because the mean of its divisors is an integer number (790034757120).
Almost surely, 210505505101005 is an apocalyptic number.
It is an amenable number.
10505505101005 is a deficient number, since it is larger than the sum of its proper divisors (2135051012915).
10505505101005 is a wasteful number, since it uses less digits than its factorization.
10505505101005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449420.
The product of its (nonzero) digits is 3125, while the sum is 28.
Adding to 10505505101005 its reverse (50010150550501), we get a palindrome (60515655651506).
The spelling of 10505505101005 in words is "ten trillion, five hundred five billion, five hundred five million, one hundred one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •