Base | Representation |
---|---|
bin | 101101110000010010001011… |
… | …010001010011101100010011 |
3 | 222101111102011202012101221012 |
4 | 231300102023101103230103 |
5 | 202333423313421303243 |
6 | 1551551504015321135 |
7 | 60246253365451304 |
oct | 5560221321235423 |
9 | 871442152171835 |
10 | 201230144322323 |
11 | 59133252457a16 |
12 | 1a69b9002201ab |
13 | 8838bc8b004ac |
14 | 379983b8047ab |
15 | 183e6d03b0d18 |
hex | b7048b453b13 |
201230144322323 has 2 divisors, whose sum is σ = 201230144322324. Its totient is φ = 201230144322322.
The previous prime is 201230144322313. The next prime is 201230144322349. The reversal of 201230144322323 is 323223441032102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201230144322323 - 236 = 201161424845587 is a prime.
It is a super-2 number, since 2×2012301443223232 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201230144322323.
It is not a weakly prime, because it can be changed into another prime (201230144322313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100615072161161 + 100615072161162.
It is an arithmetic number, because the mean of its divisors is an integer number (100615072161162).
Almost surely, 2201230144322323 is an apocalyptic number.
201230144322323 is a deficient number, since it is larger than the sum of its proper divisors (1).
201230144322323 is an equidigital number, since it uses as much as digits as its factorization.
201230144322323 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 201230144322323 its reverse (323223441032102), we get a palindrome (524453585354425).
The spelling of 201230144322323 in words is "two hundred one trillion, two hundred thirty billion, one hundred forty-four million, three hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •