Base | Representation |
---|---|
bin | 1100001111001010101… |
… | …1110110100110100010 |
3 | 202002122021212011012200 |
4 | 3003302223312212202 |
5 | 11421022340343242 |
6 | 240324530434030 |
7 | 21121460422551 |
oct | 3036253664642 |
9 | 662567764180 |
10 | 210230012322 |
11 | 811813a7940 |
12 | 348b1732916 |
13 | 16a948713c5 |
14 | a2649d9d98 |
15 | 570661904c |
hex | 30f2af69a2 |
210230012322 has 48 divisors (see below), whose sum is σ = 508463306208. Its totient is φ = 62224525440.
The previous prime is 210230012309. The next prime is 210230012327. The reversal of 210230012322 is 223210032012.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 210230012295 and 210230012304.
It is not an unprimeable number, because it can be changed into a prime (210230012327) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12337623 + ... + 12354650.
It is an arithmetic number, because the mean of its divisors is an integer number (10592985546).
Almost surely, 2210230012322 is an apocalyptic number.
210230012322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210230012322 is an abundant number, since it is smaller than the sum of its proper divisors (298233293886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210230012322 is a wasteful number, since it uses less digits than its factorization.
210230012322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24692335 (or 24692332 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 210230012322 its reverse (223210032012), we get a palindrome (433440044334).
The spelling of 210230012322 in words is "two hundred ten billion, two hundred thirty million, twelve thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •