Base | Representation |
---|---|
bin | 110100010110001011001000… |
… | …011101101000001101111111 |
3 | 1010012011000201222020000221011 |
4 | 310112023020131220031333 |
5 | 220133430031223212203 |
6 | 2133350341350220051 |
7 | 66331001511441160 |
oct | 6426131035501577 |
9 | 1105130658200834 |
10 | 230222200210303 |
11 | 673a0761158144 |
12 | 219a2731054627 |
13 | 9b5cb2519b1c2 |
14 | 40bcb5766b767 |
15 | 1b9391b2b776d |
hex | d162c876837f |
230222200210303 has 24 divisors (see below), whose sum is σ = 265843301881248. Its totient is φ = 195289916924928.
The previous prime is 230222200210283. The next prime is 230222200210309. The reversal of 230222200210303 is 303012002222032.
It is not a de Polignac number, because 230222200210303 - 29 = 230222200209791 is a prime.
It is a super-2 number, since 2×2302222002103032 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230222200210309) 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, 343181175 + ... + 343851367.
It is an arithmetic number, because the mean of its divisors is an integer number (11076804245052).
Almost surely, 2230222200210303 is an apocalyptic number.
230222200210303 is a deficient number, since it is larger than the sum of its proper divisors (35621101670945).
230222200210303 is an frugal number, since it uses more digits than its factorization.
230222200210303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671631 (or 670972 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 230222200210303 its reverse (303012002222032), we get a palindrome (533234202432335).
The spelling of 230222200210303 in words is "two hundred thirty trillion, two hundred twenty-two billion, two hundred million, two hundred ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •