Base | Representation |
---|---|
bin | 11011100001001110010001… |
… | …011010111110100010110111 |
3 | 120212112101102022122201220121 |
4 | 123201032101122332202313 |
5 | 111330430100214432411 |
6 | 1105224321330512411 |
7 | 34331103143665462 |
oct | 3341162132764267 |
9 | 525471368581817 |
10 | 121030323202231 |
11 | 35622743214813 |
12 | 116a85a2435707 |
13 | 526c158a20211 |
14 | 21c5c828142d9 |
15 | ded423089571 |
hex | 6e13916be8b7 |
121030323202231 has 2 divisors, whose sum is σ = 121030323202232. Its totient is φ = 121030323202230.
The previous prime is 121030323202193. The next prime is 121030323202253. The reversal of 121030323202231 is 132202323030121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121030323202231 - 241 = 118831299946679 is a prime.
It is a super-2 number, since 2×1210303232022312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121030323202196 and 121030323202205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121030323202631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60515161601115 + 60515161601116.
It is an arithmetic number, because the mean of its divisors is an integer number (60515161601116).
Almost surely, 2121030323202231 is an apocalyptic number.
121030323202231 is a deficient number, since it is larger than the sum of its proper divisors (1).
121030323202231 is an equidigital number, since it uses as much as digits as its factorization.
121030323202231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 121030323202231 its reverse (132202323030121), we get a palindrome (253232646232352).
The spelling of 121030323202231 in words is "one hundred twenty-one trillion, thirty billion, three hundred twenty-three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •