Base | Representation |
---|---|
bin | 1101011011101001000… |
… | …00011011000100100001 |
3 | 1122010020212001221110001 |
4 | 12231310200123010201 |
5 | 30030141114012332 |
6 | 552003444540001 |
7 | 45225541416103 |
oct | 6556440330441 |
9 | 1563225057401 |
10 | 461516157217 |
11 | 168800925855 |
12 | 755409b1601 |
13 | 346a0226a7b |
14 | 184a2163573 |
15 | c0122d80e7 |
hex | 6b7481b121 |
461516157217 has 4 divisors (see below), whose sum is σ = 481582077120. Its totient is φ = 441450237316.
The previous prime is 461516157173. The next prime is 461516157251. The reversal of 461516157217 is 712751615164.
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-461516157217 is a prime.
It is a super-2 number, since 2×4615161572172 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (461516157617) 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 in 3 ways as a sum of consecutive naturals, for example, 10032959917 + ... + 10032959962.
It is an arithmetic number, because the mean of its divisors is an integer number (120395519280).
Almost surely, 2461516157217 is an apocalyptic number.
It is an amenable number.
461516157217 is a deficient number, since it is larger than the sum of its proper divisors (20065919903).
461516157217 is a wasteful number, since it uses less digits than its factorization.
461516157217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20065919902.
The product of its digits is 352800, while the sum is 46.
The spelling of 461516157217 in words is "four hundred sixty-one billion, five hundred sixteen million, one hundred fifty-seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •