Base | Representation |
---|---|
bin | 111101101010100… |
… | …000100001100001 |
3 | 2200002200202112010 |
4 | 331222200201201 |
5 | 4104321202231 |
6 | 250354023133 |
7 | 34431362535 |
oct | 7552404141 |
9 | 2602622463 |
10 | 1034553441 |
11 | 490a84349 |
12 | 24a577aa9 |
13 | 1364478cc |
14 | 9b583bc5 |
15 | 60c59546 |
hex | 3daa0861 |
1034553441 has 4 divisors (see below), whose sum is σ = 1379404592. Its totient is φ = 689702292.
The previous prime is 1034553437. The next prime is 1034553461. The reversal of 1034553441 is 1443554301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1034553441 - 22 = 1034553437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1034553399 and 1034553408.
It is not an unprimeable number, because it can be changed into a prime (1034553431) 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 in 3 ways as a sum of consecutive naturals, for example, 172425571 + ... + 172425576.
It is an arithmetic number, because the mean of its divisors is an integer number (344851148).
Almost surely, 21034553441 is an apocalyptic number.
It is an amenable number.
1034553441 is a deficient number, since it is larger than the sum of its proper divisors (344851151).
1034553441 is an equidigital number, since it uses as much as digits as its factorization.
1034553441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344851150.
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 1034553441 is about 32164.4748286055. The cubic root of 1034553441 is about 1011.3876430095.
The spelling of 1034553441 in words is "one billion, thirty-four million, five hundred fifty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •