Base | Representation |
---|---|
bin | 10011110011011000… |
… | …11111110101011111 |
3 | 1000102221022101200200 |
4 | 21321230133311133 |
5 | 133233200024323 |
6 | 4514544554543 |
7 | 524314320111 |
oct | 117154376537 |
9 | 30387271620 |
10 | 10631642463 |
11 | 4566315382 |
12 | 2088622a53 |
13 | 1005814800 |
14 | 72bdc53b1 |
15 | 42357b443 |
hex | 279b1fd5f |
10631642463 has 36 divisors (see below), whose sum is σ = 16690987872. Its totient is φ = 6518154240.
The previous prime is 10631642447. The next prime is 10631642467. The reversal of 10631642463 is 36424613601.
10631642463 is a `hidden beast` number, since 1 + 0 + 6 + 3 + 1 + 642 + 4 + 6 + 3 = 666.
It is not a de Polignac number, because 10631642463 - 24 = 10631642447 is a prime.
It is a super-2 number, since 2×106316424632 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10631642467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 399295 + ... + 425087.
It is an arithmetic number, because the mean of its divisors is an integer number (463638552).
Almost surely, 210631642463 is an apocalyptic number.
10631642463 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10631642463 is a deficient number, since it is larger than the sum of its proper divisors (6059345409).
10631642463 is a wasteful number, since it uses less digits than its factorization.
10631642463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26096 (or 26080 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
The spelling of 10631642463 in words is "ten billion, six hundred thirty-one million, six hundred forty-two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •