Base | Representation |
---|---|
bin | 10111100010111100… |
… | …01000101000100101 |
3 | 1012121222112121122211 |
4 | 23301132020220211 |
5 | 201342113041313 |
6 | 5450211323421 |
7 | 625154642200 |
oct | 136136105045 |
9 | 35558477584 |
10 | 12641143333 |
11 | 53a76610a5 |
12 | 25495b0571 |
13 | 1265c37490 |
14 | 87cc34937 |
15 | 4debb8e3d |
hex | 2f1788a25 |
12641143333 has 24 divisors (see below), whose sum is σ = 15892342368. Its totient is φ = 9966299616.
The previous prime is 12641143259. The next prime is 12641143337. The reversal of 12641143333 is 33334114621.
It is not a de Polignac number, because 12641143333 - 29 = 12641142821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12641143295 and 12641143304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12641143337) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145210 + ... + 215332.
It is an arithmetic number, because the mean of its divisors is an integer number (662180932).
Almost surely, 212641143333 is an apocalyptic number.
12641143333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12641143333 is a deficient number, since it is larger than the sum of its proper divisors (3251199035).
12641143333 is a wasteful number, since it uses less digits than its factorization.
12641143333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70433 (or 70426 counting only the distinct ones).
The product of its digits is 15552, while the sum is 31.
Adding to 12641143333 its reverse (33334114621), we get a palindrome (45975257954).
It can be divided in two parts, 126411 and 43333, that added together give a square (169744 = 4122).
The spelling of 12641143333 in words is "twelve billion, six hundred forty-one million, one hundred forty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •