Base | Representation |
---|---|
bin | 101000000100101… |
… | …0111001010001001 |
3 | 10110201011100120012 |
4 | 1100021113022021 |
5 | 10223211201213 |
6 | 341232041305 |
7 | 45215115155 |
oct | 12011271211 |
9 | 3421140505 |
10 | 1344631433 |
11 | 630011552 |
12 | 316393235 |
13 | 185763902 |
14 | ca81c065 |
15 | 7d0a94a8 |
hex | 50257289 |
1344631433 has 2 divisors, whose sum is σ = 1344631434. Its totient is φ = 1344631432.
The previous prime is 1344631427. The next prime is 1344631459. The reversal of 1344631433 is 3341364431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1110755584 + 233875849 = 33328^2 + 15293^2 .
It is a cyclic number.
It is not a de Polignac number, because 1344631433 - 210 = 1344630409 is a prime.
It is a super-2 number, since 2×13446314332 = 3616067381223266978, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1344631433.
It is not a weakly prime, because it can be changed into another prime (1344631403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672315716 + 672315717.
It is an arithmetic number, because the mean of its divisors is an integer number (672315717).
Almost surely, 21344631433 is an apocalyptic number.
It is an amenable number.
1344631433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1344631433 is an equidigital number, since it uses as much as digits as its factorization.
1344631433 is an evil number, because the sum of its binary digits is even.
The product of its digits is 31104, while the sum is 32.
The square root of 1344631433 is about 36669.2164219526. The cubic root of 1344631433 is about 1103.7424684713.
Adding to 1344631433 its reverse (3341364431), we get a palindrome (4685995864).
The spelling of 1344631433 in words is "one billion, three hundred forty-four million, six hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •