Base | Representation |
---|---|
bin | 10111100010100100… |
… | …01001100001101111 |
3 | 1012121202121222112212 |
4 | 23301102021201233 |
5 | 201340312020023 |
6 | 5450020121035 |
7 | 625116144506 |
oct | 136122114157 |
9 | 35552558485 |
10 | 12638001263 |
11 | 53a5905448 |
12 | 254853617b |
13 | 12653a7274 |
14 | 87c65783d |
15 | 4de797e78 |
hex | 2f148986f |
12638001263 has 8 divisors (see below), whose sum is σ = 13842841680. Its totient is φ = 11484430720.
The previous prime is 12638001251. The next prime is 12638001283. The reversal of 12638001263 is 36210083621.
12638001263 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 cyclic number.
It is not a de Polignac number, because 12638001263 - 210 = 12638000239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12638001283) 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 7 ways as a sum of consecutive naturals, for example, 12816953 + ... + 12817938.
It is an arithmetic number, because the mean of its divisors is an integer number (1730355210).
Almost surely, 212638001263 is an apocalyptic number.
12638001263 is a deficient number, since it is larger than the sum of its proper divisors (1204840417).
12638001263 is a wasteful number, since it uses less digits than its factorization.
12638001263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25634937.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 12638001263 its reverse (36210083621), we get a palindrome (48848084884).
The spelling of 12638001263 in words is "twelve billion, six hundred thirty-eight million, one thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •