Base | Representation |
---|---|
bin | 11101101110001011001… |
… | …00111000101111011101 |
3 | 10121121221201102021011022 |
4 | 32313011210320233131 |
5 | 113212430314432201 |
6 | 2101050512133525 |
7 | 133531556014334 |
oct | 16670544705735 |
9 | 3547851367138 |
10 | 1021222030301 |
11 | 364109238410 |
12 | 145b052372a5 |
13 | 753babac215 |
14 | 375dab54d1b |
15 | 1b86e92041b |
hex | edc5938bdd |
1021222030301 has 16 divisors (see below), whose sum is σ = 1152866295360. Its totient is φ = 896067083520.
The previous prime is 1021222030219. The next prime is 1021222030303. The reversal of 1021222030301 is 1030302221201.
It is a cyclic number.
It is not a de Polignac number, because 1021222030301 - 210 = 1021222029277 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1021222030301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021222030303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 404981 + ... + 1485413.
It is an arithmetic number, because the mean of its divisors is an integer number (72054143460).
Almost surely, 21021222030301 is an apocalyptic number.
1021222030301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1021222030301 is a deficient number, since it is larger than the sum of its proper divisors (131644265059).
1021222030301 is a wasteful number, since it uses less digits than its factorization.
1021222030301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1083436.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1021222030301 its reverse (1030302221201), we get a palindrome (2051524251502).
The spelling of 1021222030301 in words is "one trillion, twenty-one billion, two hundred twenty-two million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •