Base | Representation |
---|---|
bin | 110100011111011001101111… |
… | …0011001000110000100011101 |
3 | 2020112210022012222220202102112 |
4 | 1220332303132121012010131 |
5 | 441004200120123043123 |
6 | 4313551520541203405 |
7 | 166152433336050353 |
oct | 15076633631060435 |
9 | 2215708188822375 |
10 | 461712715440413 |
11 | 124130299049928 |
12 | 4394b026260565 |
13 | 16a82425c80838 |
14 | 820302c3437d3 |
15 | 385a319992d78 |
hex | 1a3ecde64611d |
461712715440413 has 8 divisors (see below), whose sum is σ = 461935074458880. Its totient is φ = 461490361581760.
The previous prime is 461712715440329. The next prime is 461712715440437. The reversal of 461712715440413 is 314044517217164.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 461712715440413 - 28 = 461712715440157 is a prime.
It is a super-2 number, since 2×4617127154404132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (461712715440013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184128806 + ... + 186619512.
It is an arithmetic number, because the mean of its divisors is an integer number (57741884307360).
Almost surely, 2461712715440413 is an apocalyptic number.
It is an amenable number.
461712715440413 is a deficient number, since it is larger than the sum of its proper divisors (222359018467).
461712715440413 is a wasteful number, since it uses less digits than its factorization.
461712715440413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2579907.
The product of its (nonzero) digits is 2257920, while the sum is 50.
The spelling of 461712715440413 in words is "four hundred sixty-one trillion, seven hundred twelve billion, seven hundred fifteen million, four hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •