Base | Representation |
---|---|
bin | 101111110011001001110100… |
… | …011010010011010101010010 |
3 | 1000120100011101202101020100200 |
4 | 233303021310122103111102 |
5 | 210023300032103301002 |
6 | 2023035150150200030 |
7 | 62165066244250155 |
oct | 5763116432232522 |
9 | 1016304352336320 |
10 | 210223422322002 |
11 | 60a90286429781 |
12 | 1b6b285a953016 |
13 | 903bca31512ab |
14 | 39cac21857c9c |
15 | 19485d8888b1c |
hex | bf3274693552 |
210223422322002 has 12 divisors (see below), whose sum is σ = 455484081697710. Its totient is φ = 70074474107328.
The previous prime is 210223422321959. The next prime is 210223422322003. The reversal of 210223422322002 is 200223224322012.
210223422322002 is a `hidden beast` number, since 2 + 1 + 0 + 2 + 2 + 3 + 422 + 32 + 200 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 152030157662601 + 58193264659401 = 12330051^2 + 7628451^2 .
It is not an unprimeable number, because it can be changed into a prime (210223422322003) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5839539508927 + ... + 5839539508962.
Almost surely, 2210223422322002 is an apocalyptic number.
210223422322002 is an abundant number, since it is smaller than the sum of its proper divisors (245260659375708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210223422322002 is a wasteful number, since it uses less digits than its factorization.
210223422322002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11679079017897 (or 11679079017894 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 27.
Adding to 210223422322002 its reverse (200223224322012), we get a palindrome (410446646644014).
The spelling of 210223422322002 in words is "two hundred ten trillion, two hundred twenty-three billion, four hundred twenty-two million, three hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •