Base | Representation |
---|---|
bin | 101111001000111111… |
… | …0110010100110110101 |
3 | 100200022010111202220222 |
4 | 1132101332302212311 |
5 | 3124311222414331 |
6 | 114301143104125 |
7 | 10212441511346 |
oct | 1362176624665 |
9 | 320263452828 |
10 | 101233404341 |
11 | 39a29688033 |
12 | 17752a42045 |
13 | 97141cb5b4 |
14 | 4c84ba80cd |
15 | 2977672b7b |
hex | 1791fb29b5 |
101233404341 has 2 divisors, whose sum is σ = 101233404342. Its totient is φ = 101233404340.
The previous prime is 101233404287. The next prime is 101233404379. The reversal of 101233404341 is 143404332101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50927400241 + 50306004100 = 225671^2 + 224290^2 .
It is a cyclic number.
It is not a de Polignac number, because 101233404341 - 26 = 101233404277 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101233404341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101233464341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50616702170 + 50616702171.
It is an arithmetic number, because the mean of its divisors is an integer number (50616702171).
Almost surely, 2101233404341 is an apocalyptic number.
It is an amenable number.
101233404341 is a deficient number, since it is larger than the sum of its proper divisors (1).
101233404341 is an equidigital number, since it uses as much as digits as its factorization.
101233404341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 101233404341 its reverse (143404332101), we get a palindrome (244637736442).
The spelling of 101233404341 in words is "one hundred one billion, two hundred thirty-three million, four hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •