Base | Representation |
---|---|
bin | 11011111011001… |
… | …001000010010101 |
3 | 1012122112200012001 |
4 | 123323021002111 |
5 | 1424413111331 |
6 | 114253155301 |
7 | 14416041136 |
oct | 3373110225 |
9 | 1178480161 |
10 | 468488341 |
11 | 2204a4252 |
12 | 110a8bb31 |
13 | 760a1049 |
14 | 46311c8d |
15 | 2b1e1561 |
hex | 1bec9095 |
468488341 has 2 divisors, whose sum is σ = 468488342. Its totient is φ = 468488340.
The previous prime is 468488323. The next prime is 468488347. The reversal of 468488341 is 143884864.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 316484100 + 152004241 = 17790^2 + 12329^2 .
It is a cyclic number.
It is not a de Polignac number, because 468488341 - 25 = 468488309 is a prime.
It is a super-3 number, since 3×4684883413 (a number of 27 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 468488291 and 468488300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (468488347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 234244170 + 234244171.
It is an arithmetic number, because the mean of its divisors is an integer number (234244171).
Almost surely, 2468488341 is an apocalyptic number.
It is an amenable number.
468488341 is a deficient number, since it is larger than the sum of its proper divisors (1).
468488341 is an equidigital number, since it uses as much as digits as its factorization.
468488341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 589824, while the sum is 46.
The square root of 468488341 is about 21644.5914953367. The cubic root of 468488341 is about 776.6635599680.
It can be divided in two parts, 4684 and 88341, that added together give a square (93025 = 3052).
The spelling of 468488341 in words is "four hundred sixty-eight million, four hundred eighty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •