Base | Representation |
---|---|
bin | 1001001000000000101010… |
… | …1100011000101111110000 |
3 | 1022112011111120012002112211 |
4 | 2102000022230120233300 |
5 | 2303341020042330222 |
6 | 33201110553301504 |
7 | 2053606422313504 |
oct | 222001254305760 |
9 | 38464446162484 |
10 | 10033223011312 |
11 | 321907a908166 |
12 | 116060a104894 |
13 | 57a18a1880b7 |
14 | 269879632304 |
15 | 125ec19b3277 |
hex | 9200ab18bf0 |
10033223011312 has 40 divisors (see below), whose sum is σ = 19685888236800. Its totient is φ = 4952996697792.
The previous prime is 10033223011297. The next prime is 10033223011319. The reversal of 10033223011312 is 21311032233001.
It is a super-3 number, since 3×100332230113123 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10033223011319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92241663 + ... + 92350369.
It is an arithmetic number, because the mean of its divisors is an integer number (492147205920).
Almost surely, 210033223011312 is an apocalyptic number.
It is an amenable number.
10033223011312 is a deficient number, since it is larger than the sum of its proper divisors (9652665225488).
10033223011312 is a wasteful number, since it uses less digits than its factorization.
10033223011312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181813 (or 181807 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10033223011312 its reverse (21311032233001), we get a palindrome (31344255244313).
The spelling of 10033223011312 in words is "ten trillion, thirty-three billion, two hundred twenty-three million, eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •