Base | Representation |
---|---|
bin | 10111000010101110… |
… | …11010011001100001 |
3 | 1011221011010011002121 |
4 | 23201113122121201 |
5 | 200313430230013 |
6 | 5403320144241 |
7 | 615364205614 |
oct | 134127323141 |
9 | 34834104077 |
10 | 12370945633 |
11 | 5279092612 |
12 | 2493008081 |
13 | 1221c72697 |
14 | 854dbc17b |
15 | 4c60e558d |
hex | 2e15da661 |
12370945633 has 2 divisors, whose sum is σ = 12370945634. Its totient is φ = 12370945632.
The previous prime is 12370945549. The next prime is 12370945637. The reversal of 12370945633 is 33654907321.
It is a happy number.
12370945633 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12243865104 + 127080529 = 110652^2 + 11273^2 .
It is a cyclic number.
It is not a de Polignac number, because 12370945633 - 213 = 12370937441 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12370945633.
It is not a weakly prime, because it can be changed into another prime (12370945637) 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, 6185472816 + 6185472817.
It is an arithmetic number, because the mean of its divisors is an integer number (6185472817).
Almost surely, 212370945633 is an apocalyptic number.
It is an amenable number.
12370945633 is a deficient number, since it is larger than the sum of its proper divisors (1).
12370945633 is an equidigital number, since it uses as much as digits as its factorization.
12370945633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 43.
The spelling of 12370945633 in words is "twelve billion, three hundred seventy million, nine hundred forty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •