Base | Representation |
---|---|
bin | 1101011001000000000… |
… | …10100000101001100001 |
3 | 1121222121002111101211001 |
4 | 12230200002200221201 |
5 | 30014240322421401 |
6 | 551211102552001 |
7 | 45145453136521 |
oct | 6544002405141 |
9 | 1558532441731 |
10 | 460099029601 |
11 | 1681439a8902 |
12 | 75206298601 |
13 | 3450575c413 |
14 | 183a9c73681 |
15 | be7cbad601 |
hex | 6b200a0a61 |
460099029601 has 2 divisors, whose sum is σ = 460099029602. Its totient is φ = 460099029600.
The previous prime is 460099029569. The next prime is 460099029647. The reversal of 460099029601 is 106920990064.
It is an a-pointer prime, because the next prime (460099029647) can be obtained adding 460099029601 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 284114584576 + 175984445025 = 533024^2 + 419505^2 .
It is a cyclic number.
It is not a de Polignac number, because 460099029601 - 25 = 460099029569 is a prime.
It is a super-2 number, since 2×4600990296012 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (460099029661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 230049514800 + 230049514801.
It is an arithmetic number, because the mean of its divisors is an integer number (230049514801).
Almost surely, 2460099029601 is an apocalyptic number.
It is an amenable number.
460099029601 is a deficient number, since it is larger than the sum of its proper divisors (1).
460099029601 is an equidigital number, since it uses as much as digits as its factorization.
460099029601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 46.
The spelling of 460099029601 in words is "four hundred sixty billion, ninety-nine million, twenty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •