Base | Representation |
---|---|
bin | 11101101101110011000… |
… | …11000010111100100101 |
3 | 10121121102122200022010221 |
4 | 32312321203002330211 |
5 | 113212022134034341 |
6 | 2101014502444341 |
7 | 133523555453560 |
oct | 16667143027445 |
9 | 3547378608127 |
10 | 1021020221221 |
11 | 36401532a250 |
12 | 145a697336b1 |
13 | 75388140670 |
14 | 375bc0214d7 |
15 | 1b85bd59ed1 |
hex | edb98c2f25 |
1021020221221 has 32 divisors (see below), whose sum is σ = 1451520338688. Its totient is φ = 691200138240.
The previous prime is 1021020221219. The next prime is 1021020221251. The reversal of 1021020221221 is 1221220201201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1021020221221 - 21 = 1021020221219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021020221195 and 1021020221204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021020221251) 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, 29982990 + ... + 30017023.
It is an arithmetic number, because the mean of its divisors is an integer number (45360010584).
Almost surely, 21021020221221 is an apocalyptic number.
1021020221221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1021020221221 is a deficient number, since it is larger than the sum of its proper divisors (430500117467).
1021020221221 is a wasteful number, since it uses less digits than its factorization.
1021020221221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60000061.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1021020221221 its reverse (1221220201201), we get a palindrome (2242240422422).
The spelling of 1021020221221 in words is "one trillion, twenty-one billion, twenty million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •