Base | Representation |
---|---|
bin | 110100010110001011001000… |
… | …011001101000001100110101 |
3 | 1010012011000201220020202110021 |
4 | 310112023020121220030311 |
5 | 220133430030441133103 |
6 | 2133350341311525141 |
7 | 66331001466512656 |
oct | 6426131031501465 |
9 | 1105130656222407 |
10 | 230222199161653 |
11 | 673a0760601296 |
12 | 219a27308297b1 |
13 | 9b5cb24bc1aba |
14 | 40bcb5747752d |
15 | 1b9391b15bbbd |
hex | d162c8668335 |
230222199161653 has 2 divisors, whose sum is σ = 230222199161654. Its totient is φ = 230222199161652.
The previous prime is 230222199161573. The next prime is 230222199161671. The reversal of 230222199161653 is 356161991222032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 219378073547889 + 10844125613764 = 14811417^2 + 3293042^2 .
It is a cyclic number.
It is not a de Polignac number, because 230222199161653 - 217 = 230222199030581 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230222199161653.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230222199164653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115111099580826 + 115111099580827.
It is an arithmetic number, because the mean of its divisors is an integer number (115111099580827).
Almost surely, 2230222199161653 is an apocalyptic number.
It is an amenable number.
230222199161653 is a deficient number, since it is larger than the sum of its proper divisors (1).
230222199161653 is an equidigital number, since it uses as much as digits as its factorization.
230222199161653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2099520, while the sum is 52.
The spelling of 230222199161653 in words is "two hundred thirty trillion, two hundred twenty-two billion, one hundred ninety-nine million, one hundred sixty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •