Base | Representation |
---|---|
bin | 10111100001110000… |
… | …10010110101010011 |
3 | 1012121021212122101121 |
4 | 23300320102311103 |
5 | 201332043124020 |
6 | 5445214543111 |
7 | 625004425612 |
oct | 136070226523 |
9 | 35537778347 |
10 | 12631223635 |
11 | 53a1aa62a8 |
12 | 2546207a97 |
13 | 1263b73334 |
14 | 87b7b1879 |
15 | 4ddda9baa |
hex | 2f0e12d53 |
12631223635 has 8 divisors (see below), whose sum is σ = 16049084256. Its totient is φ = 9510568320.
The previous prime is 12631223587. The next prime is 12631223659. The reversal of 12631223635 is 53632213621.
12631223635 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 not a de Polignac number, because 12631223635 - 215 = 12631190867 is a prime.
It is a super-2 number, since 2×126312236352 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12631223635.
It is an unprimeable number.
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, 74301231 + ... + 74301400.
It is an arithmetic number, because the mean of its divisors is an integer number (2006135532).
Almost surely, 212631223635 is an apocalyptic number.
12631223635 is a deficient number, since it is larger than the sum of its proper divisors (3417860621).
12631223635 is a wasteful number, since it uses less digits than its factorization.
12631223635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148602653.
The product of its digits is 38880, while the sum is 34.
The spelling of 12631223635 in words is "twelve billion, six hundred thirty-one million, two hundred twenty-three thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •