Base | Representation |
---|---|
bin | 101111110001101010101000… |
… | …110011000011010010100101 |
3 | 1000112222101121020110110111122 |
4 | 233301222220303003102211 |
5 | 210020111230313310041 |
6 | 2022520205022543325 |
7 | 62154520522033010 |
oct | 5761525063032245 |
9 | 1015871536413448 |
10 | 210121222010021 |
11 | 60a50a00a80723 |
12 | 1b696a98137b45 |
13 | 90324668311ca |
14 | 39c5cc84b8377 |
15 | 1945b063bec4b |
hex | bf1aa8cc34a5 |
210121222010021 has 32 divisors (see below), whose sum is σ = 240655860539136. Its totient is φ = 179716492800000.
The previous prime is 210121222009967. The next prime is 210121222010069. The reversal of 210121222010021 is 120010222121012.
210121222010021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 210121222010021 - 230 = 210120148268197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210121222010321) 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, 22322445311 + ... + 22322454723.
It is an arithmetic number, because the mean of its divisors is an integer number (7520495641848).
Almost surely, 2210121222010021 is an apocalyptic number.
It is an amenable number.
210121222010021 is a deficient number, since it is larger than the sum of its proper divisors (30534638529115).
210121222010021 is a wasteful number, since it uses less digits than its factorization.
210121222010021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13853.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 210121222010021 its reverse (120010222121012), we get a palindrome (330131444131033).
The spelling of 210121222010021 in words is "two hundred ten trillion, one hundred twenty-one billion, two hundred twenty-two million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •