Base | Representation |
---|---|
bin | 10110110111010101… |
… | …10000001100101111 |
3 | 1011200111020111210021 |
4 | 23123222300030233 |
5 | 200114442233432 |
6 | 5350023223011 |
7 | 613123526215 |
oct | 133352601457 |
9 | 34614214707 |
10 | 12275352367 |
11 | 522a130a13 |
12 | 2466ba7a67 |
13 | 1208212915 |
14 | 846416cb5 |
15 | 4bca11697 |
hex | 2dbab032f |
12275352367 has 4 divisors (see below), whose sum is σ = 12997431936. Its totient is φ = 11553272800.
The previous prime is 12275352343. The next prime is 12275352389. The reversal of 12275352367 is 76325357221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 76325357221 = 194891 ⋅391631.
It is a cyclic number.
It is not a de Polignac number, because 12275352367 - 211 = 12275350319 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 (12275352307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 361039759 + ... + 361039792.
It is an arithmetic number, because the mean of its divisors is an integer number (3249357984).
Almost surely, 212275352367 is an apocalyptic number.
12275352367 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
12275352367 is a deficient number, since it is larger than the sum of its proper divisors (722079569).
12275352367 is an equidigital number, since it uses as much as digits as its factorization.
12275352367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722079568.
The product of its digits is 529200, while the sum is 43.
The spelling of 12275352367 in words is "twelve billion, two hundred seventy-five million, three hundred fifty-two thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •