Base | Representation |
---|---|
bin | 11011111100001… |
… | …011000011011101 |
3 | 1012200001102010011 |
4 | 123330023003131 |
5 | 1430000234444 |
6 | 114303043221 |
7 | 14421245404 |
oct | 3374130335 |
9 | 1180042104 |
10 | 468758749 |
11 | 220669428 |
12 | 110ba0511 |
13 | 76167154 |
14 | 4638263b |
15 | 2b246734 |
hex | 1bf0b0dd |
468758749 has 2 divisors, whose sum is σ = 468758750. Its totient is φ = 468758748.
The previous prime is 468758729. The next prime is 468758767. The reversal of 468758749 is 947857864.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 452412900 + 16345849 = 21270^2 + 4043^2 .
It is a cyclic number.
It is not a de Polignac number, because 468758749 - 27 = 468758621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 468758693 and 468758702.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (468758729) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 234379374 + 234379375.
It is an arithmetic number, because the mean of its divisors is an integer number (234379375).
Almost surely, 2468758749 is an apocalyptic number.
It is an amenable number.
468758749 is a deficient number, since it is larger than the sum of its proper divisors (1).
468758749 is an equidigital number, since it uses as much as digits as its factorization.
468758749 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13547520, while the sum is 58.
The square root of 468758749 is about 21650.8371431684. The cubic root of 468758749 is about 776.8129593788.
It can be divided in two parts, 4687 and 58749, that added together give a palindrome (63436).
The spelling of 468758749 in words is "four hundred sixty-eight million, seven hundred fifty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •