Base | Representation |
---|---|
bin | 110100101000111011001010… |
… | …1101101110100010000110101 |
3 | 2020201102102022201212211220110 |
4 | 1221101312111231310100311 |
5 | 441142120423024123023 |
6 | 4320433042304053233 |
7 | 166346124306115536 |
oct | 15121662555642065 |
9 | 2221372281784813 |
10 | 463021461161013 |
11 | 124595331976387 |
12 | 43b207b2604219 |
13 | 16b48975c47a81 |
14 | 824a50323268d |
15 | 387e3b65b7a93 |
hex | 1a51d95b74435 |
463021461161013 has 8 divisors (see below), whose sum is σ = 617402096676288. Its totient is φ = 308660899876544.
The previous prime is 463021461160981. The next prime is 463021461161053. The reversal of 463021461161013 is 310161164120364.
It is a happy number.
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 463021461161013 - 25 = 463021461160981 is a prime.
It is a super-2 number, since 2×4630214611610132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (463021461161053) 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, 5018503881 + ... + 5018596142.
It is an arithmetic number, because the mean of its divisors is an integer number (77175262084536).
Almost surely, 2463021461161013 is an apocalyptic number.
It is an amenable number.
463021461161013 is a deficient number, since it is larger than the sum of its proper divisors (154380635515275).
463021461161013 is a wasteful number, since it uses less digits than its factorization.
463021461161013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10037115403.
The product of its (nonzero) digits is 62208, while the sum is 39.
The spelling of 463021461161013 in words is "four hundred sixty-three trillion, twenty-one billion, four hundred sixty-one million, one hundred sixty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •