Base | Representation |
---|---|
bin | 11101011001110101010… |
… | …00111110000110100101 |
3 | 10120120202121211012201200 |
4 | 32230322220332012211 |
5 | 113023044042230341 |
6 | 2052043111313113 |
7 | 132664126640262 |
oct | 16547250760645 |
9 | 3516677735650 |
10 | 1010301133221 |
11 | 35a514718836 |
12 | 14397797b799 |
13 | 7436a48c843 |
14 | 36c82596269 |
15 | 1b430ca8db6 |
hex | eb3aa3e1a5 |
1010301133221 has 48 divisors (see below), whose sum is σ = 1575868694400. Its totient is φ = 622052196480.
The previous prime is 1010301133189. The next prime is 1010301133241. The reversal of 1010301133221 is 1223311030101.
1010301133221 is a `hidden beast` number, since 1 + 0 + 10 + 301 + 1 + 332 + 21 = 666.
It is not a de Polignac number, because 1010301133221 - 25 = 1010301133189 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1010301133194 and 1010301133203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010301133241) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 499855 + ... + 1506803.
It is an arithmetic number, because the mean of its divisors is an integer number (32830597800).
Almost surely, 21010301133221 is an apocalyptic number.
It is an amenable number.
1010301133221 is a deficient number, since it is larger than the sum of its proper divisors (565567561179).
1010301133221 is a wasteful number, since it uses less digits than its factorization.
1010301133221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1007146 (or 1007143 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1010301133221 its reverse (1223311030101), we get a palindrome (2233612163322).
The spelling of 1010301133221 in words is "one trillion, ten billion, three hundred one million, one hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •