Base | Representation |
---|---|
bin | 101111110010110101001001… |
… | …000111101111110101000110 |
3 | 1000120021001002112001110001002 |
4 | 233302311021013233311012 |
5 | 210022414100111414342 |
6 | 2023021035151133302 |
7 | 62163352133655416 |
oct | 5762651107576506 |
9 | 1016231075043032 |
10 | 210201221201222 |
11 | 60a81923485079 |
12 | 1b6aa4a3814232 |
13 | 9039b75741b34 |
14 | 39c9b170c2646 |
15 | 1947c3977dd32 |
hex | bf2d491efd46 |
210201221201222 has 4 divisors (see below), whose sum is σ = 315301831801836. Its totient is φ = 105100610600610.
The previous prime is 210201221201197. The next prime is 210201221201227. The reversal of 210201221201222 is 222102122102012.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2102012212012222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210201221201194 and 210201221201203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210201221201227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52550305300304 + ... + 52550305300307.
It is an arithmetic number, because the mean of its divisors is an integer number (78825457950459).
Almost surely, 2210201221201222 is an apocalyptic number.
210201221201222 is a deficient number, since it is larger than the sum of its proper divisors (105100610600614).
210201221201222 is a wasteful number, since it uses less digits than its factorization.
210201221201222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105100610600613.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 210201221201222 its reverse (222102122102012), we get a palindrome (432303343303234).
The spelling of 210201221201222 in words is "two hundred ten trillion, two hundred one billion, two hundred twenty-one million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •