Base | Representation |
---|---|
bin | 1101011001000001111… |
… | …11111110011010101001 |
3 | 1121222122012211000022011 |
4 | 12230200333332122221 |
5 | 30014303434023223 |
6 | 551212440155521 |
7 | 45146040115411 |
oct | 6544077763251 |
9 | 1558565730264 |
10 | 460115142313 |
11 | 1681520035a2 |
12 | 7520b768ba1 |
13 | 34508bb1378 |
14 | 183ac069641 |
15 | be7e2e280d |
hex | 6b20ffe6a9 |
460115142313 has 8 divisors (see below), whose sum is σ = 469944220032. Its totient is φ = 450287706096.
The previous prime is 460115142299. The next prime is 460115142317. The reversal of 460115142313 is 313241511064.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-460115142313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (460115142317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164731 + ... + 973327.
It is an arithmetic number, because the mean of its divisors is an integer number (58743027504).
Almost surely, 2460115142313 is an apocalyptic number.
It is an amenable number.
460115142313 is a deficient number, since it is larger than the sum of its proper divisors (9829077719).
460115142313 is a wasteful number, since it uses less digits than its factorization.
460115142313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820751.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 460115142313 its reverse (313241511064), we get a palindrome (773356653377).
It can be divided in two parts, 4601151 and 42313, that added together give a palindrome (4643464).
The spelling of 460115142313 in words is "four hundred sixty billion, one hundred fifteen million, one hundred forty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •