Base | Representation |
---|---|
bin | 1001100011100000001111… |
… | …1010000011010010110001 |
3 | 1101012022200020012102111220 |
4 | 2120320003322003102301 |
5 | 2334110334210234010 |
6 | 34202104031055253 |
7 | 2133000313561533 |
oct | 230700372032261 |
9 | 41168606172456 |
10 | 10505555555505 |
11 | 33904212605aa |
12 | 1218069371529 |
13 | 5b289226bc3a |
14 | 28468610b853 |
15 | 13341866b970 |
hex | 98e03e834b1 |
10505555555505 has 16 divisors (see below), whose sum is σ = 16808975656704. Its totient is φ = 5602934040320.
The previous prime is 10505555555503. The next prime is 10505555555531. The reversal of 10505555555505 is 50555555550501.
It is not a de Polignac number, because 10505555555505 - 21 = 10505555555503 is a prime.
It is a super-2 number, since 2×105055555555052 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10505555555503) 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, 1375897 + ... + 4785833.
It is an arithmetic number, because the mean of its divisors is an integer number (1050560978544).
Almost surely, 210505555555505 is an apocalyptic number.
10505555555505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10505555555505 is a deficient number, since it is larger than the sum of its proper divisors (6303420101199).
10505555555505 is a wasteful number, since it uses less digits than its factorization.
10505555555505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3615336.
The product of its (nonzero) digits is 9765625, while the sum is 51.
The spelling of 10505555555505 in words is "ten trillion, five hundred five billion, five hundred fifty-five million, five hundred fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •