Base | Representation |
---|---|
bin | 10111000010101110… |
… | …11010011000001101 |
3 | 1011221011010010222111 |
4 | 23201113122120031 |
5 | 200313430224144 |
6 | 5403320144021 |
7 | 615364205434 |
oct | 134127323015 |
9 | 34834103874 |
10 | 12370945549 |
11 | 5279092546 |
12 | 2493008011 |
13 | 1221c72631 |
14 | 854dbc11b |
15 | 4c60e5534 |
hex | 2e15da60d |
12370945549 has 2 divisors, whose sum is σ = 12370945550. Its totient is φ = 12370945548.
The previous prime is 12370945519. The next prime is 12370945633. The reversal of 12370945549 is 94554907321.
12370945549 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., 9192015625 + 3178929924 = 95875^2 + 56382^2 .
It is a cyclic number.
It is not a de Polignac number, because 12370945549 - 27 = 12370945421 is a prime.
It is a super-2 number, since 2×123709455492 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12370945519) 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, 6185472774 + 6185472775.
It is an arithmetic number, because the mean of its divisors is an integer number (6185472775).
Almost surely, 212370945549 is an apocalyptic number.
It is an amenable number.
12370945549 is a deficient number, since it is larger than the sum of its proper divisors (1).
12370945549 is an equidigital number, since it uses as much as digits as its factorization.
12370945549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1360800, while the sum is 49.
The spelling of 12370945549 in words is "twelve billion, three hundred seventy million, nine hundred forty-five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •