Base | Representation |
---|---|
bin | 1001010010011111100000… |
… | …1100100011011111000001 |
3 | 1100011101022112021011010021 |
4 | 2110213320030203133001 |
5 | 2314313320113200413 |
6 | 33415531552133441 |
7 | 2102613061454110 |
oct | 224477014433701 |
9 | 40141275234107 |
10 | 10213301303233 |
11 | 3288489364206 |
12 | 118b4a5b37281 |
13 | 5911580b2412 |
14 | 27447d9abc77 |
15 | 12aa10ed418d |
hex | 949f83237c1 |
10213301303233 has 8 divisors (see below), whose sum is σ = 11694662408768. Its totient is φ = 8737519713264.
The previous prime is 10213301303143. The next prime is 10213301303279. The reversal of 10213301303233 is 33230310331201.
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 10213301303233 - 221 = 10213299206081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10213301303198 and 10213301303207.
It is not an unprimeable number, because it can be changed into a prime (10213301303333) 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, 1394874966 + ... + 1394882287.
It is an arithmetic number, because the mean of its divisors is an integer number (1461832801096).
Almost surely, 210213301303233 is an apocalyptic number.
It is an amenable number.
10213301303233 is a deficient number, since it is larger than the sum of its proper divisors (1481361105535).
10213301303233 is an equidigital number, since it uses as much as digits as its factorization.
10213301303233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2789757783.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 10213301303233 its reverse (33230310331201), we get a palindrome (43443611634434).
The spelling of 10213301303233 in words is "ten trillion, two hundred thirteen billion, three hundred one million, three hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •