Base | Representation |
---|---|
bin | 1001010010011110011001… |
… | …1000011101101110110001 |
3 | 1100011100112200220002200011 |
4 | 2110213212120131232301 |
5 | 2314312212110414010 |
6 | 33415442154254521 |
7 | 2102602502231452 |
oct | 224474630355661 |
9 | 40140480802604 |
10 | 10213002435505 |
11 | 3288345693491 |
12 | 118b421a27441 |
13 | 59110b1bcacc |
14 | 274452011129 |
15 | 12a9e4b4aa8a |
hex | 949e661dbb1 |
10213002435505 has 8 divisors (see below), whose sum is σ = 12463325006400. Its totient is φ = 8031920559216.
The previous prime is 10213002435491. The next prime is 10213002435509. The reversal of 10213002435505 is 50553420031201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10213002435505 - 215 = 10213002402737 is a prime.
It is a zygodrome in base 3.
It is not an unprimeable number, because it can be changed into a prime (10213002435509) 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, 17310173325 + ... + 17310173914.
It is an arithmetic number, because the mean of its divisors is an integer number (1557915625800).
Almost surely, 210213002435505 is an apocalyptic number.
It is an amenable number.
10213002435505 is a deficient number, since it is larger than the sum of its proper divisors (2250322570895).
10213002435505 is an equidigital number, since it uses as much as digits as its factorization.
10213002435505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34620347303.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 10213002435505 its reverse (50553420031201), we get a palindrome (60766422466706).
The spelling of 10213002435505 in words is "ten trillion, two hundred thirteen billion, two million, four hundred thirty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •