Base | Representation |
---|---|
bin | 1101011111100010000… |
… | …01010011010101001100 |
3 | 1122022122102212211021002 |
4 | 12233301001103111030 |
5 | 30043430404313202 |
6 | 552551031155432 |
7 | 45331365523121 |
oct | 6576101232514 |
9 | 1568572784232 |
10 | 463605151052 |
11 | 16968302683a |
12 | 75a24515b78 |
13 | 34943c600b4 |
14 | 1861d786748 |
15 | c0d58c9302 |
hex | 6bf105354c |
463605151052 has 48 divisors (see below), whose sum is σ = 863129030400. Its totient is φ = 217261517760.
The previous prime is 463605151043. The next prime is 463605151057. The reversal of 463605151052 is 250151506364.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a junction number, because it is equal to n+sod(n) for n = 463605150997 and 463605151015.
It is not an unprimeable number, because it can be changed into a prime (463605151057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8277599 + ... + 8333417.
It is an arithmetic number, because the mean of its divisors is an integer number (17981854800).
Almost surely, 2463605151052 is an apocalyptic number.
It is an amenable number.
463605151052 is a deficient number, since it is larger than the sum of its proper divisors (399523879348).
463605151052 is a wasteful number, since it uses less digits than its factorization.
463605151052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57006 (or 57004 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 38.
The spelling of 463605151052 in words is "four hundred sixty-three billion, six hundred five million, one hundred fifty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •