Base | Representation |
---|---|
bin | 1001011001010111000111… |
… | …0001011011101000100111 |
3 | 1100120122220102021200110120 |
4 | 2112111301301123220213 |
5 | 2323232003103134120 |
6 | 33550045215453023 |
7 | 2114261241445044 |
oct | 226256161335047 |
9 | 40518812250416 |
10 | 10331305130535 |
11 | 3323533456224 |
12 | 11aa339227173 |
13 | 59c3128624bc |
14 | 27a075b741cb |
15 | 12db1aad1140 |
hex | 96571c5ba27 |
10331305130535 has 32 divisors (see below), whose sum is σ = 16542127800000. Its totient is φ = 5506017420288.
The previous prime is 10331305130527. The next prime is 10331305130567. The reversal of 10331305130535 is 53503150313301.
It is not a de Polignac number, because 10331305130535 - 23 = 10331305130527 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10331305130496 and 10331305130505.
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 31 ways as a sum of consecutive naturals, for example, 150241341 + ... + 150310089.
It is an arithmetic number, because the mean of its divisors is an integer number (516941493750).
Almost surely, 210331305130535 is an apocalyptic number.
10331305130535 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10331305130535 is a deficient number, since it is larger than the sum of its proper divisors (6210822669465).
10331305130535 is a wasteful number, since it uses less digits than its factorization.
10331305130535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75907.
The product of its (nonzero) digits is 30375, while the sum is 33.
Adding to 10331305130535 its reverse (53503150313301), we get a palindrome (63834455443836).
The spelling of 10331305130535 in words is "ten trillion, three hundred thirty-one billion, three hundred five million, one hundred thirty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •