Base | Representation |
---|---|
bin | 1001010010010100000000… |
… | …0100111111100000101101 |
3 | 1100011002100020210012022112 |
4 | 2110211000010333200231 |
5 | 2314241003323010013 |
6 | 33414301244253405 |
7 | 2102443402463060 |
oct | 224450004774055 |
9 | 40132306705275 |
10 | 10210212313133 |
11 | 3287143742228 |
12 | 118a983541265 |
13 | 590a85140821 |
14 | 27426963c8d7 |
15 | 12a8cec12ba8 |
hex | 9494013f82d |
10210212313133 has 8 divisors (see below), whose sum is σ = 11953419293760. Its totient is φ = 8538156637920.
The previous prime is 10210212313099. The next prime is 10210212313153. The reversal of 10210212313133 is 33131321201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10210212313133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10210212313099 and 10210212313108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210212313153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17787826043 + ... + 17787826616.
It is an arithmetic number, because the mean of its divisors is an integer number (1494177411720).
Almost surely, 210210212313133 is an apocalyptic number.
It is an amenable number.
10210212313133 is a deficient number, since it is larger than the sum of its proper divisors (1743206980627).
10210212313133 is an equidigital number, since it uses as much as digits as its factorization.
10210212313133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35575652707.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10210212313133 its reverse (33131321201201), we get a palindrome (43341533514334).
The spelling of 10210212313133 in words is "ten trillion, two hundred ten billion, two hundred twelve million, three hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •