Base | Representation |
---|---|
bin | 1101011001100110111… |
… | …11011000001000100001 |
3 | 1122000102211112220110022 |
4 | 12230303133120020201 |
5 | 30020422343122001 |
6 | 551303321243225 |
7 | 45156525010001 |
oct | 6546337301041 |
9 | 1560384486408 |
10 | 460425364001 |
11 | 1682a1129759 |
12 | 75297633515 |
13 | 3455824a8b5 |
14 | 183db340001 |
15 | be9b67011b |
hex | 6b337d8221 |
460425364001 has 4 divisors (see below), whose sum is σ = 480443858112. Its totient is φ = 440406869892.
The previous prime is 460425363949. The next prime is 460425364019. The reversal of 460425364001 is 100463524064.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-460425364001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (460425364051) 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 in 3 ways as a sum of consecutive naturals, for example, 10009247021 + ... + 10009247066.
It is an arithmetic number, because the mean of its divisors is an integer number (120110964528).
Almost surely, 2460425364001 is an apocalyptic number.
It is an amenable number.
460425364001 is a deficient number, since it is larger than the sum of its proper divisors (20018494111).
460425364001 is a wasteful number, since it uses less digits than its factorization.
460425364001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20018494110.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 460425364001 its reverse (100463524064), we get a palindrome (560888888065).
The spelling of 460425364001 in words is "four hundred sixty billion, four hundred twenty-five million, three hundred sixty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •