Base | Representation |
---|---|
bin | 110100011101100010010001… |
… | …0000001110101100100100101 |
3 | 2020111212202222122211112022011 |
4 | 1220323010202001311210211 |
5 | 440440444144423001303 |
6 | 4313234010231434221 |
7 | 166125051426113056 |
oct | 15073044201654445 |
9 | 2214782878745264 |
10 | 461456152156453 |
11 | 124041500834263 |
12 | 43909363825971 |
13 | 16a6418921418c |
14 | 81d484ddb672d |
15 | 385380087716d |
hex | 1a3b122075925 |
461456152156453 has 4 divisors (see below), whose sum is σ = 461503828181440. Its totient is φ = 461408476131468.
The previous prime is 461456152156423. The next prime is 461456152156541. The reversal of 461456152156453 is 354651251654164.
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 not a de Polignac number, because 461456152156453 - 217 = 461456152025381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (461456152156423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23837997975 + ... + 23838017332.
It is an arithmetic number, because the mean of its divisors is an integer number (115375957045360).
Almost surely, 2461456152156453 is an apocalyptic number.
It is an amenable number.
461456152156453 is a deficient number, since it is larger than the sum of its proper divisors (47676024987).
461456152156453 is an equidigital number, since it uses as much as digits as its factorization.
461456152156453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47676024986.
The product of its digits is 51840000, while the sum is 58.
The spelling of 461456152156453 in words is "four hundred sixty-one trillion, four hundred fifty-six billion, one hundred fifty-two million, one hundred fifty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •