Base | Representation |
---|---|
bin | 1001001000000000010000… |
… | …0001011110101100110101 |
3 | 1022112011012202121102101022 |
4 | 2102000010001132230311 |
5 | 2303340302420201323 |
6 | 33201051514510525 |
7 | 2053603563142205 |
oct | 222000401365465 |
9 | 38464182542338 |
10 | 10033111100213 |
11 | 3219022720753 |
12 | 1160598735445 |
13 | 57a16cc33c06 |
14 | 269868820405 |
15 | 125eb6c594c8 |
hex | 9200405eb35 |
10033111100213 has 8 divisors (see below), whose sum is σ = 10036574978400. Its totient is φ = 10029647558448.
The previous prime is 10033111100209. The next prime is 10033111100269. The reversal of 10033111100213 is 31200111133001.
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 10033111100213 - 22 = 10033111100209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10033111100191 and 10033111100200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10033111100413) 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, 69234770 + ... + 69379532.
It is an arithmetic number, because the mean of its divisors is an integer number (1254571872300).
Almost surely, 210033111100213 is an apocalyptic number.
It is an amenable number.
10033111100213 is a deficient number, since it is larger than the sum of its proper divisors (3463878187).
10033111100213 is a wasteful number, since it uses less digits than its factorization.
10033111100213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168211.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10033111100213 its reverse (31200111133001), we get a palindrome (41233222233214).
The spelling of 10033111100213 in words is "ten trillion, thirty-three billion, one hundred eleven million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •