Base | Representation |
---|---|
bin | 11101011010001110100… |
… | …11000110001111101011 |
3 | 10120121022102102201120212 |
4 | 32231013103012033223 |
5 | 113024012424100321 |
6 | 2052120135211335 |
7 | 133002316024622 |
oct | 16550723061753 |
9 | 3517272381525 |
10 | 1010513503211 |
11 | 35a61358a523 |
12 | 143a16b16b4b |
13 | 743a2488364 |
14 | 36ca28786b9 |
15 | 1b44475855b |
hex | eb474c63eb |
1010513503211 has 8 divisors (see below), whose sum is σ = 1043137699200. Its totient is φ = 977890993920.
The previous prime is 1010513503171. The next prime is 1010513503213. The reversal of 1010513503211 is 1123053150101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010513503211 is a prime.
It is a super-2 number, since 2×10105135032112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1010513503213) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 857525 + ... + 1660233.
It is an arithmetic number, because the mean of its divisors is an integer number (130392212400).
Almost surely, 21010513503211 is an apocalyptic number.
1010513503211 is a deficient number, since it is larger than the sum of its proper divisors (32624195989).
1010513503211 is an equidigital number, since it uses as much as digits as its factorization.
1010513503211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843349.
The product of its (nonzero) digits is 450, while the sum is 23.
Adding to 1010513503211 its reverse (1123053150101), we get a palindrome (2133566653312).
The spelling of 1010513503211 in words is "one trillion, ten billion, five hundred thirteen million, five hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •