Base | Representation |
---|---|
bin | 11000000111001010… |
… | …11111111001000001 |
3 | 1020102011102100201220 |
4 | 30003211133321001 |
5 | 203002414012424 |
6 | 5540305345253 |
7 | 635535136611 |
oct | 140345377101 |
9 | 36364370656 |
10 | 12945063489 |
11 | 5543172886 |
12 | 2613338229 |
13 | 12b3ba86a7 |
14 | 8ab348a41 |
15 | 50b6ee579 |
hex | 30395fe41 |
12945063489 has 16 divisors (see below), whose sum is σ = 18204960000. Its totient is φ = 8159427216.
The previous prime is 12945063487. The next prime is 12945063503. The reversal of 12945063489 is 98436054921.
12945063489 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12945063489 - 21 = 12945063487 is a prime.
It is a super-3 number, since 3×129450634893 (a number of 31 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12945063487) 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 15 ways as a sum of consecutive naturals, for example, 199119 + ... + 256004.
It is an arithmetic number, because the mean of its divisors is an integer number (1137810000).
Almost surely, 212945063489 is an apocalyptic number.
12945063489 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
12945063489 is a deficient number, since it is larger than the sum of its proper divisors (5259896511).
12945063489 is a wasteful number, since it uses less digits than its factorization.
12945063489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455644.
The product of its (nonzero) digits is 1866240, while the sum is 51.
The spelling of 12945063489 in words is "twelve billion, nine hundred forty-five million, sixty-three thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •