Base | Representation |
---|---|
bin | 1001011001100000000001… |
… | …0101110110011100101101 |
3 | 1100120220002010002101110021 |
4 | 2112120000111312130231 |
5 | 2323301402420322341 |
6 | 33551122422442141 |
7 | 2114404434403360 |
oct | 226300025663455 |
9 | 40526063071407 |
10 | 10333697042221 |
11 | 3324550643943 |
12 | 11aa8a6293351 |
13 | 59c604278767 |
14 | 27a2216ca0d7 |
15 | 12dc0aaaa9d1 |
hex | 9660057672d |
10333697042221 has 4 divisors (see below), whose sum is σ = 11809939476832. Its totient is φ = 8857454607612.
The previous prime is 10333697042219. The next prime is 10333697042237. The reversal of 10333697042221 is 12224079633301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10333697042221 - 21 = 10333697042219 is a prime.
It is a super-2 number, since 2×103336970422212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10333697042261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 738121217295 + ... + 738121217308.
It is an arithmetic number, because the mean of its divisors is an integer number (2952484869208).
Almost surely, 210333697042221 is an apocalyptic number.
It is an amenable number.
10333697042221 is a deficient number, since it is larger than the sum of its proper divisors (1476242434611).
10333697042221 is an equidigital number, since it uses as much as digits as its factorization.
10333697042221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1476242434610.
The product of its (nonzero) digits is 326592, while the sum is 43.
The spelling of 10333697042221 in words is "ten trillion, three hundred thirty-three billion, six hundred ninety-seven million, forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •