Base | Representation |
---|---|
bin | 110100101001110111100111… |
… | …1000011010000000011010101 |
3 | 2020201212211101111001210122111 |
4 | 1221103233033003100003111 |
5 | 441201232301124200203 |
6 | 4321012431311031021 |
7 | 166361401165646005 |
oct | 15123571703200325 |
9 | 2221784344053574 |
10 | 463151272100053 |
11 | 124635395854189 |
12 | 43b4199bb0b471 |
13 | 16b57c928c53c4 |
14 | 82528d9566005 |
15 | 3882962a3326d |
hex | 1a53bcf0d00d5 |
463151272100053 has 8 divisors (see below), whose sum is σ = 464445800078400. Its totient is φ = 461856768639168.
The previous prime is 463151272100047. The next prime is 463151272100117. The reversal of 463151272100053 is 350001272151364.
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 463151272100053 - 217 = 463151271968981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 463151272099979 and 463151272100015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (463151272100453) 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, 32036413 + ... + 44188621.
It is an arithmetic number, because the mean of its divisors is an integer number (58055725009800).
Almost surely, 2463151272100053 is an apocalyptic number.
It is an amenable number.
463151272100053 is a deficient number, since it is larger than the sum of its proper divisors (1294527978347).
463151272100053 is a wasteful number, since it uses less digits than its factorization.
463151272100053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12258731.
The product of its (nonzero) digits is 151200, while the sum is 40.
The spelling of 463151272100053 in words is "four hundred sixty-three trillion, one hundred fifty-one billion, two hundred seventy-two million, one hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •