Base | Representation |
---|---|
bin | 100010000110111… |
… | …0010100011100001 |
3 | 2221202111212201001 |
4 | 1010031302203201 |
5 | 4320440400013 |
6 | 305321512001 |
7 | 40234540333 |
oct | 10415624341 |
9 | 2852455631 |
10 | 1144465633 |
11 | 538025a73 |
12 | 27b342601 |
13 | 15314bccc |
14 | abdd5453 |
15 | 6a71addd |
hex | 443728e1 |
1144465633 has 2 divisors, whose sum is σ = 1144465634. Its totient is φ = 1144465632.
The previous prime is 1144465613. The next prime is 1144465639. The reversal of 1144465633 is 3365644411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 716472289 + 427993344 = 26767^2 + 20688^2 .
It is a cyclic number.
It is not a de Polignac number, because 1144465633 - 29 = 1144465121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1144465592 and 1144465601.
It is not a weakly prime, because it can be changed into another prime (1144465639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572232816 + 572232817.
It is an arithmetic number, because the mean of its divisors is an integer number (572232817).
Almost surely, 21144465633 is an apocalyptic number.
It is an amenable number.
1144465633 is a deficient number, since it is larger than the sum of its proper divisors (1).
1144465633 is an equidigital number, since it uses as much as digits as its factorization.
1144465633 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 37.
The square root of 1144465633 is about 33829.9517144202. The cubic root of 1144465633 is about 1046.0061836466.
It can be divided in two parts, 11444656 and 33, that added together give a square (11444689 = 33832).
The spelling of 1144465633 in words is "one billion, one hundred forty-four million, four hundred sixty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •