Base | Representation |
---|---|
bin | 1001100100111011010110… |
… | …0011100001010011100111 |
3 | 1101021122210120010002111011 |
4 | 2121032311203201103213 |
5 | 2340010430233030210 |
6 | 34221230432323051 |
7 | 2134524325150213 |
oct | 231166543412347 |
9 | 41248716102434 |
10 | 10530010830055 |
11 | 339a830662302 |
12 | 12209533a3487 |
13 | 5b4c8b9909b2 |
14 | 285925db9943 |
15 | 133d9a5ddd8a |
hex | 993b58e14e7 |
10530010830055 has 16 divisors (see below), whose sum is σ = 12663830821824. Its totient is φ = 8405482567680.
The previous prime is 10530010830047. The next prime is 10530010830121. The reversal of 10530010830055 is 55003801003501.
It is not a de Polignac number, because 10530010830055 - 23 = 10530010830047 is a prime.
It is a super-2 number, since 2×105300108300552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10530010829999 and 10530010830026.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3215175 + ... + 5603335.
It is an arithmetic number, because the mean of its divisors is an integer number (791489426364).
Almost surely, 210530010830055 is an apocalyptic number.
10530010830055 is a deficient number, since it is larger than the sum of its proper divisors (2133819991769).
10530010830055 is a wasteful number, since it uses less digits than its factorization.
10530010830055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2390106.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 10530010830055 its reverse (55003801003501), we get a palindrome (65533811833556).
The spelling of 10530010830055 in words is "ten trillion, five hundred thirty billion, ten million, eight hundred thirty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •