Base | Representation |
---|---|
bin | 11100000001010001111110… |
… | …111000001111111010000111 |
3 | 121011022222202200020020220201 |
4 | 130001101332320033322013 |
5 | 112123023330031100041 |
6 | 1114032335503111331 |
7 | 34646212543424566 |
oct | 3401217670177207 |
9 | 534288680206821 |
10 | 123233330331271 |
11 | 362a1a64316306 |
12 | 119a3540ba2547 |
13 | 539bb125b2b44 |
14 | 226074c8c5bdd |
15 | e3a8ad4dc631 |
hex | 70147ee0fe87 |
123233330331271 has 2 divisors, whose sum is σ = 123233330331272. Its totient is φ = 123233330331270.
The previous prime is 123233330331269. The next prime is 123233330331283. The reversal of 123233330331271 is 172133033332321.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 123233330331271 - 21 = 123233330331269 is a prime.
Together with 123233330331269, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 123233330331271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123233330311271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61616665165635 + 61616665165636.
It is an arithmetic number, because the mean of its divisors is an integer number (61616665165636).
Almost surely, 2123233330331271 is an apocalyptic number.
123233330331271 is a deficient number, since it is larger than the sum of its proper divisors (1).
123233330331271 is an equidigital number, since it uses as much as digits as its factorization.
123233330331271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 37.
Adding to 123233330331271 its reverse (172133033332321), we get a palindrome (295366363663592).
The spelling of 123233330331271 in words is "one hundred twenty-three trillion, two hundred thirty-three billion, three hundred thirty million, three hundred thirty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •