Base | Representation |
---|---|
bin | 11011111001100… |
… | …000111011001001 |
3 | 1012121202000012211 |
4 | 123321200323021 |
5 | 1424310440042 |
6 | 114240105121 |
7 | 14412313642 |
oct | 3371407311 |
9 | 1177660184 |
10 | 468061897 |
11 | 220232916 |
12 | 1109051a1 |
13 | 75c81c04 |
14 | 462406c9 |
15 | 2b15a017 |
hex | 1be60ec9 |
468061897 has 2 divisors, whose sum is σ = 468061898. Its totient is φ = 468061896.
The previous prime is 468061879. The next prime is 468061931. The reversal of 468061897 is 798160864.
Together with previous prime (468061879) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 407595721 + 60466176 = 20189^2 + 7776^2 .
It is a cyclic number.
It is not a de Polignac number, because 468061897 - 211 = 468059849 is a prime.
It is equal to p24758797 and since 468061897 and 24758797 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 468061897.
It is not a weakly prime, because it can be changed into another prime (468062897) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 234030948 + 234030949.
It is an arithmetic number, because the mean of its divisors is an integer number (234030949).
Almost surely, 2468061897 is an apocalyptic number.
It is an amenable number.
468061897 is a deficient number, since it is larger than the sum of its proper divisors (1).
468061897 is an equidigital number, since it uses as much as digits as its factorization.
468061897 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 580608, while the sum is 49.
The square root of 468061897 is about 21634.7382004035. The cubic root of 468061897 is about 776.4278343869.
The spelling of 468061897 in words is "four hundred sixty-eight million, sixty-one thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •