Base | Representation |
---|---|
bin | 111110001111000… |
… | …010101010000001 |
3 | 2200202201022200112 |
4 | 332033002222001 |
5 | 4114244133213 |
6 | 251335201105 |
7 | 34605651023 |
oct | 7617025201 |
9 | 2622638615 |
10 | 1044130433 |
11 | 496425715 |
12 | 251816195 |
13 | 13841ba78 |
14 | 9c958013 |
15 | 619ebea8 |
hex | 3e3c2a81 |
1044130433 has 2 divisors, whose sum is σ = 1044130434. Its totient is φ = 1044130432.
The previous prime is 1044130403. The next prime is 1044130441. The reversal of 1044130433 is 3340314401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1014231409 + 29899024 = 31847^2 + 5468^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1044130433 is a prime.
It is a super-2 number, since 2×10441304332 = 2180416722233534978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1044130399 and 1044130408.
It is not a weakly prime, because it can be changed into another prime (1044130403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 522065216 + 522065217.
It is an arithmetic number, because the mean of its divisors is an integer number (522065217).
Almost surely, 21044130433 is an apocalyptic number.
It is an amenable number.
1044130433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1044130433 is an equidigital number, since it uses as much as digits as its factorization.
1044130433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 1044130433 is about 32313.0071797720. The cubic root of 1044130433 is about 1014.4989099640.
Adding to 1044130433 its reverse (3340314401), we get a palindrome (4384444834).
The spelling of 1044130433 in words is "one billion, forty-four million, one hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •