Base | Representation |
---|---|
bin | 111110001011001… |
… | …000000110010001 |
3 | 2200200210011212212 |
4 | 332023020012101 |
5 | 4114013313040 |
6 | 251301201505 |
7 | 34564144646 |
oct | 7613100621 |
9 | 2620704785 |
10 | 1043104145 |
11 | 495894646 |
12 | 251400295 |
13 | 13814c8b5 |
14 | 9c76bdcd |
15 | 61897d65 |
hex | 3e2c8191 |
1043104145 has 8 divisors (see below), whose sum is σ = 1253273280. Its totient is φ = 833451120.
The previous prime is 1043104141. The next prime is 1043104177. The reversal of 1043104145 is 5414013401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1043104145 - 22 = 1043104141 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1043104145.
It is not an unprimeable number, because it can be changed into a prime (1043104141) 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 7 ways as a sum of consecutive naturals, for example, 124565 + ... + 132674.
It is an arithmetic number, because the mean of its divisors is an integer number (156659160).
Almost surely, 21043104145 is an apocalyptic number.
It is an amenable number.
1043104145 is a deficient number, since it is larger than the sum of its proper divisors (210169135).
1043104145 is an equidigital number, since it uses as much as digits as its factorization.
1043104145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258055.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 1043104145 is about 32297.1228594747. The cubic root of 1043104145 is about 1014.1664133920.
Adding to 1043104145 its reverse (5414013401), we get a palindrome (6457117546).
The spelling of 1043104145 in words is "one billion, forty-three million, one hundred four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •