Base | Representation |
---|---|
bin | 100001111110110… |
… | …1110101001011011 |
3 | 2221110120222020122 |
4 | 1003331232221123 |
5 | 4313401132243 |
6 | 305051343455 |
7 | 40154003354 |
oct | 10375565133 |
9 | 2843528218 |
10 | 1140255323 |
11 | 53570a779 |
12 | 279a51b8b |
13 | 1523067bc |
14 | ab61ad2b |
15 | 6a188668 |
hex | 43f6ea5b |
1140255323 has 2 divisors, whose sum is σ = 1140255324. Its totient is φ = 1140255322.
The previous prime is 1140255317. The next prime is 1140255329. The reversal of 1140255323 is 3235520411.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1140255317) and next prime (1140255329).
It is a cyclic number.
It is not a de Polignac number, because 1140255323 - 224 = 1123478107 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1140255292 and 1140255301.
It is not a weakly prime, because it can be changed into another prime (1140255329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570127661 + 570127662.
It is an arithmetic number, because the mean of its divisors is an integer number (570127662).
Almost surely, 21140255323 is an apocalyptic number.
1140255323 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140255323 is an equidigital number, since it uses as much as digits as its factorization.
1140255323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 1140255323 is about 33767.6668278991. Note that the first 3 decimals coincide. The cubic root of 1140255323 is about 1044.7219097789.
Adding to 1140255323 its reverse (3235520411), we get a palindrome (4375775734).
The spelling of 1140255323 in words is "one billion, one hundred forty million, two hundred fifty-five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •