Base | Representation |
---|---|
bin | 11000001100101000… |
… | …11101110001110101 |
3 | 1020112100201121210221 |
4 | 30012110131301311 |
5 | 203101134230122 |
6 | 5545024414341 |
7 | 636633040411 |
oct | 140624356165 |
9 | 36470647727 |
10 | 12990930037 |
11 | 5567050018 |
12 | 26267773b1 |
13 | 12c0547567 |
14 | 8b3487d41 |
15 | 51075e6c7 |
hex | 30651dc75 |
12990930037 has 2 divisors, whose sum is σ = 12990930038. Its totient is φ = 12990930036.
The previous prime is 12990930019. The next prime is 12990930083. The reversal of 12990930037 is 73003909921.
12990930037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9193166161 + 3797763876 = 95881^2 + 61626^2 .
It is a cyclic number.
It is not a de Polignac number, because 12990930037 - 219 = 12990405749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12990929975 and 12990930002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12990930437) 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 as a sum of consecutive naturals, namely, 6495465018 + 6495465019.
It is an arithmetic number, because the mean of its divisors is an integer number (6495465019).
Almost surely, 212990930037 is an apocalyptic number.
It is an amenable number.
12990930037 is a deficient number, since it is larger than the sum of its proper divisors (1).
12990930037 is an equidigital number, since it uses as much as digits as its factorization.
12990930037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 91854, while the sum is 43.
The spelling of 12990930037 in words is "twelve billion, nine hundred ninety million, nine hundred thirty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •