Base | Representation |
---|---|
bin | 10111011000110010… |
… | …11111001101111001 |
3 | 1012102001101212111201 |
4 | 23230121133031321 |
5 | 201203321222113 |
6 | 5433531254201 |
7 | 623102366536 |
oct | 135431371571 |
9 | 35361355451 |
10 | 12556039033 |
11 | 5363613a6a |
12 | 2524baa361 |
13 | 125140a9c5 |
14 | 8717ddd8d |
15 | 4d74a7cdd |
hex | 2ec65f379 |
12556039033 has 2 divisors, whose sum is σ = 12556039034. Its totient is φ = 12556039032.
The previous prime is 12556039009. The next prime is 12556039103. The reversal of 12556039033 is 33093065521.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8116748649 + 4439290384 = 90093^2 + 66628^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12556039033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12556038983 and 12556039001.
It is not a weakly prime, because it can be changed into another prime (12556039003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6278019516 + 6278019517.
It is an arithmetic number, because the mean of its divisors is an integer number (6278019517).
Almost surely, 212556039033 is an apocalyptic number.
It is an amenable number.
12556039033 is a deficient number, since it is larger than the sum of its proper divisors (1).
12556039033 is an equidigital number, since it uses as much as digits as its factorization.
12556039033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72900, while the sum is 37.
The spelling of 12556039033 in words is "twelve billion, five hundred fifty-six million, thirty-nine thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •