Base | Representation |
---|---|
bin | 1001010010011011000111… |
… | …0011000010111101100111 |
3 | 1100011021021012211110120201 |
4 | 2110212301303002331213 |
5 | 2314303410233230203 |
6 | 33415214441211331 |
7 | 2102541600366313 |
oct | 224466163027547 |
9 | 40137235743521 |
10 | 10212120211303 |
11 | 3287a326a237a |
12 | 118b216490b47 |
13 | 590cca4ab35a |
14 | 2743aaba0b43 |
15 | 12a992480e1d |
hex | 949b1cc2f67 |
10212120211303 has 4 divisors (see below), whose sum is σ = 10214158156888. Its totient is φ = 10210082265720.
The previous prime is 10212120211301. The next prime is 10212120211367. The reversal of 10212120211303 is 30311202121201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10212120211303 - 21 = 10212120211301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212120211301) 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 3 ways as a sum of consecutive naturals, for example, 1018965276 + ... + 1018975297.
It is an arithmetic number, because the mean of its divisors is an integer number (2553539539222).
Almost surely, 210212120211303 is an apocalyptic number.
10212120211303 is a deficient number, since it is larger than the sum of its proper divisors (2037945585).
10212120211303 is an equidigital number, since it uses as much as digits as its factorization.
10212120211303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2037945584.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10212120211303 its reverse (30311202121201), we get a palindrome (40523322332504).
The spelling of 10212120211303 in words is "ten trillion, two hundred twelve billion, one hundred twenty million, two hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •