Base | Representation |
---|---|
bin | 110100011010100001101000… |
… | …0001000001101000001011001 |
3 | 2020110102020011211101012101021 |
4 | 1220311003100020031001121 |
5 | 440412204430033430431 |
6 | 4312315552135322441 |
7 | 166053134661226036 |
oct | 15065032010150131 |
9 | 2213366154335337 |
10 | 461042461233241 |
11 | 1239a2012017698 |
12 | 4386114b520421 |
13 | 16a3416b322354 |
14 | 81bc8077d438d |
15 | 3847b8c04db11 |
hex | 1a350d020d059 |
461042461233241 has 4 divisors (see below), whose sum is σ = 461042509564800. Its totient is φ = 461042412901684.
The previous prime is 461042461233169. The next prime is 461042461233251. The reversal of 461042461233241 is 142332164240164.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 461042461233241 - 247 = 320304972877913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (461042461233251) 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, 4549021 + ... + 30704698.
It is an arithmetic number, because the mean of its divisors is an integer number (115260627391200).
Almost surely, 2461042461233241 is an apocalyptic number.
It is an amenable number.
461042461233241 is a deficient number, since it is larger than the sum of its proper divisors (48331559).
461042461233241 is a wasteful number, since it uses less digits than its factorization.
461042461233241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48331558.
The product of its (nonzero) digits is 663552, while the sum is 43.
The spelling of 461042461233241 in words is "four hundred sixty-one trillion, forty-two billion, four hundred sixty-one million, two hundred thirty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •