Base | Representation |
---|---|
bin | 100100101100101… |
… | …1100100011101101 |
3 | 10011211002222022022 |
4 | 1021121130203231 |
5 | 10010220013331 |
6 | 322105155525 |
7 | 42341534603 |
oct | 11131344355 |
9 | 3154088268 |
10 | 1231407341 |
11 | 58210861a |
12 | 2a448bba5 |
13 | 16816cbc8 |
14 | b9787873 |
15 | 7319167b |
hex | 4965c8ed |
1231407341 has 2 divisors, whose sum is σ = 1231407342. Its totient is φ = 1231407340.
The previous prime is 1231407283. The next prime is 1231407343. The reversal of 1231407341 is 1437041321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 683613316 + 547794025 = 26146^2 + 23405^2 .
It is a cyclic number.
It is not a de Polignac number, because 1231407341 - 218 = 1231145197 is a prime.
Together with 1231407343, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1231407341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1231407343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 615703670 + 615703671.
It is an arithmetic number, because the mean of its divisors is an integer number (615703671).
Almost surely, 21231407341 is an apocalyptic number.
It is an amenable number.
1231407341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1231407341 is an equidigital number, since it uses as much as digits as its factorization.
1231407341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 1231407341 is about 35091.4140638419. The cubic root of 1231407341 is about 1071.8497543782.
Adding to 1231407341 its reverse (1437041321), we get a palindrome (2668448662).
The spelling of 1231407341 in words is "one billion, two hundred thirty-one million, four hundred seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •