Base | Representation |
---|---|
bin | 11001011100110001… |
… | …10000110010110110 |
3 | 1022021012121200120200 |
4 | 30232120300302312 |
5 | 210440231121032 |
6 | 10135440341330 |
7 | 662404550253 |
oct | 145630606266 |
9 | 38235550520 |
10 | 13663145142 |
11 | 5881542199 |
12 | 2793914846 |
13 | 13998a8c8a |
14 | 93886c42a |
15 | 54e79447c |
hex | 32e630cb6 |
13663145142 has 24 divisors (see below), whose sum is σ = 29606906160. Its totient is φ = 4553854800.
The previous prime is 13663145131. The next prime is 13663145143. The reversal of 13663145142 is 24154136631.
13663145142 is a `hidden beast` number, since 1 + 3 + 6 + 631 + 4 + 5 + 14 + 2 = 666.
13663145142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13663145097 and 13663145106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13663145143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 135892 + ... + 213992.
It is an arithmetic number, because the mean of its divisors is an integer number (1233621090).
Almost surely, 213663145142 is an apocalyptic number.
13663145142 is an abundant number, since it is smaller than the sum of its proper divisors (15943761018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13663145142 is a wasteful number, since it uses less digits than its factorization.
13663145142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87828 (or 87825 counting only the distinct ones).
The product of its digits is 51840, while the sum is 36.
The spelling of 13663145142 in words is "thirteen billion, six hundred sixty-three million, one hundred forty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •