Base | Representation |
---|---|
bin | 10010110110101010… |
… | …01000100011110101 |
3 | 222010102201002211200 |
4 | 21123111020203311 |
5 | 131212240420313 |
6 | 4352225523113 |
7 | 505560202026 |
oct | 113325104365 |
9 | 28112632750 |
10 | 10122201333 |
11 | 432479a752 |
12 | 1b65aa3499 |
13 | c5410535a |
14 | 6c0492c4d |
15 | 3e399ab73 |
hex | 25b5488f5 |
10122201333 has 24 divisors (see below), whose sum is σ = 15365352288. Its totient is φ = 6413051232.
The previous prime is 10122201329. The next prime is 10122201367. The reversal of 10122201333 is 33310222101.
10122201333 is a `hidden beast` number, since 10 + 122 + 201 + 333 = 666.
10122201333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10122201333 - 22 = 10122201329 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122201233) 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 23 ways as a sum of consecutive naturals, for example, 339135 + ... + 367772.
It is an arithmetic number, because the mean of its divisors is an integer number (640223012).
Almost surely, 210122201333 is an apocalyptic number.
It is an amenable number.
10122201333 is a deficient number, since it is larger than the sum of its proper divisors (5243150955).
10122201333 is a wasteful number, since it uses less digits than its factorization.
10122201333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706993 (or 706990 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10122201333 its reverse (33310222101), we get a palindrome (43432423434).
The spelling of 10122201333 in words is "ten billion, one hundred twenty-two million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •