Base | Representation |
---|---|
bin | 1101011001010010101… |
… | …01110100010011100101 |
3 | 1121222222222010212200011 |
4 | 12230221111310103211 |
5 | 30020100300221142 |
6 | 551234355450221 |
7 | 45152356452043 |
oct | 6545125642345 |
9 | 1558888125604 |
10 | 460255085797 |
11 | 168213aa7171 |
12 | 7524a5b6971 |
13 | 3452bb9ba70 |
14 | 183c2897393 |
15 | be8b737417 |
hex | 6b295744e5 |
460255085797 has 8 divisors (see below), whose sum is σ = 502449177944. Its totient is φ = 419030972928.
The previous prime is 460255085723. The next prime is 460255085813. The reversal of 460255085797 is 797580552064.
It can be written as a sum of positive squares in 4 ways, for example, as 834112161 + 459420973636 = 28881^2 + 677806^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 460255085797 - 211 = 460255083749 is a prime.
It is a super-2 number, since 2×4602550857972 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (460255085597) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 242493828 + ... + 242495725.
It is an arithmetic number, because the mean of its divisors is an integer number (62806147243).
Almost surely, 2460255085797 is an apocalyptic number.
It is an amenable number.
460255085797 is a deficient number, since it is larger than the sum of its proper divisors (42194092147).
460255085797 is a wasteful number, since it uses less digits than its factorization.
460255085797 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 484989639.
The product of its (nonzero) digits is 21168000, while the sum is 58.
The spelling of 460255085797 in words is "four hundred sixty billion, two hundred fifty-five million, eighty-five thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •