Base | Representation |
---|---|
bin | 1001010010011010101101… |
… | …0011001111010111101111 |
3 | 1100011020222121201122012200 |
4 | 2110212223103033113233 |
5 | 2314303144332211343 |
6 | 33415155545032543 |
7 | 2102536105035024 |
oct | 224465323172757 |
9 | 40136877648180 |
10 | 10212011210223 |
11 | 3287987113239 |
12 | 118b1a5a85753 |
13 | 590cb0a35884 |
14 | 27439a50954b |
15 | 12a987aee4d3 |
hex | 949ab4cf5ef |
10212011210223 has 24 divisors (see below), whose sum is σ = 15808017365088. Its totient is φ = 6336006950592.
The previous prime is 10212011210221. The next prime is 10212011210257. The reversal of 10212011210223 is 32201211021201.
10212011210223 is a `hidden beast` number, since 10 + 21 + 201 + 1 + 210 + 223 = 666.
It is not a de Polignac number, because 10212011210223 - 21 = 10212011210221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10212011210196 and 10212011210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212011210221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 666659740 + ... + 666675057.
It is an arithmetic number, because the mean of its divisors is an integer number (658667390212).
Almost surely, 210212011210223 is an apocalyptic number.
10212011210223 is a deficient number, since it is larger than the sum of its proper divisors (5596006154865).
10212011210223 is a wasteful number, since it uses less digits than its factorization.
10212011210223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1333334863 (or 1333334860 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 10212011210223 its reverse (32201211021201), we get a palindrome (42413222231424).
The spelling of 10212011210223 in words is "ten trillion, two hundred twelve billion, eleven million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •