Base | Representation |
---|---|
bin | 1001010010011111100001… |
… | …0100010011000100000001 |
3 | 1100011101022200002021121022 |
4 | 2110213320110103010001 |
5 | 2314313321123124441 |
6 | 33415532103435225 |
7 | 2102613114640130 |
oct | 224477024230401 |
9 | 40141280067538 |
10 | 10213303333121 |
11 | 328848a5202a9 |
12 | 118b4a6755b15 |
13 | 591158643335 |
14 | 27447dd79917 |
15 | 12aa1128584b |
hex | 949f8513101 |
10213303333121 has 8 divisors (see below), whose sum is σ = 11812977349824. Its totient is φ = 8648786987280.
The previous prime is 10213303333099. The next prime is 10213303333213. The reversal of 10213303333121 is 12133330331201.
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 10213303333121 - 238 = 9938425426177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10213303333921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8789417090 + ... + 8789418251.
It is an arithmetic number, because the mean of its divisors is an integer number (1476622168728).
Almost surely, 210213303333121 is an apocalyptic number.
It is an amenable number.
10213303333121 is a deficient number, since it is larger than the sum of its proper divisors (1599674016703).
10213303333121 is an equidigital number, since it uses as much as digits as its factorization.
10213303333121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17578835431.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 10213303333121 its reverse (12133330331201), we get a palindrome (22346633664322).
The spelling of 10213303333121 in words is "ten trillion, two hundred thirteen billion, three hundred three million, three hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •