Base | Representation |
---|---|
bin | 11001011001100011… |
… | …10001000111101010 |
3 | 1022012022210222020012 |
4 | 30230301301013222 |
5 | 210411323130032 |
6 | 10133033531522 |
7 | 661626216440 |
oct | 145461610752 |
9 | 38168728205 |
10 | 13636145642 |
11 | 5868281059 |
12 | 2786873ba2 |
13 | 1394114942 |
14 | 935040b90 |
15 | 54c20e6b2 |
hex | 32cc711ea |
13636145642 has 8 divisors (see below), whose sum is σ = 23376249696. Its totient is φ = 5844062412.
The previous prime is 13636145641. The next prime is 13636145669. The reversal of 13636145642 is 24654163631.
13636145642 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 13636145642.
It is not an unprimeable number, because it can be changed into a prime (13636145641) 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 3 ways as a sum of consecutive naturals, for example, 487005188 + ... + 487005215.
It is an arithmetic number, because the mean of its divisors is an integer number (2922031212).
Almost surely, 213636145642 is an apocalyptic number.
13636145642 is a deficient number, since it is larger than the sum of its proper divisors (9740104054).
13636145642 is an equidigital number, since it uses as much as digits as its factorization.
13636145642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974010412.
The product of its digits is 311040, while the sum is 41.
The spelling of 13636145642 in words is "thirteen billion, six hundred thirty-six million, one hundred forty-five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •