Base | Representation |
---|---|
bin | 1001011001011101011101… |
… | …1101001111000100011101 |
3 | 1100120211022022101112101110 |
4 | 2112113113131033010131 |
5 | 2323244001321042341 |
6 | 33550530400532233 |
7 | 2114351435162430 |
oct | 226272735170435 |
9 | 40524268345343 |
10 | 10333011112221 |
11 | 3324229434546 |
12 | 11aa734621079 |
13 | 59c525124615 |
14 | 27a198575817 |
15 | 12dbba767216 |
hex | 965d774f11d |
10333011112221 has 32 divisors (see below), whose sum is σ = 15811735008256. Its totient is φ = 5879757600000.
The previous prime is 10333011112201. The next prime is 10333011112273. The reversal of 10333011112221 is 12221111033301.
It is not a de Polignac number, because 10333011112221 - 26 = 10333011112157 is a prime.
It is a super-2 number, since 2×103330111122212 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10333011112201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 117629406 + ... + 117717216.
It is an arithmetic number, because the mean of its divisors is an integer number (494116719008).
Almost surely, 210333011112221 is an apocalyptic number.
It is an amenable number.
10333011112221 is a deficient number, since it is larger than the sum of its proper divisors (5478723896035).
10333011112221 is a wasteful number, since it uses less digits than its factorization.
10333011112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111313.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10333011112221 its reverse (12221111033301), we get a palindrome (22554122145522).
The spelling of 10333011112221 in words is "ten trillion, three hundred thirty-three billion, eleven million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •