Base | Representation |
---|---|
bin | 111101101000110… |
… | …010111001011101 |
3 | 2200001211221120110 |
4 | 331220302321131 |
5 | 4104212320123 |
6 | 250340240233 |
7 | 34424512446 |
oct | 7550627135 |
9 | 2601757513 |
10 | 1034104413 |
11 | 4907a7a51 |
12 | 24a3a0079 |
13 | 13631b404 |
14 | 9b4a82cd |
15 | 60bbb493 |
hex | 3da32e5d |
1034104413 has 4 divisors (see below), whose sum is σ = 1378805888. Its totient is φ = 689402940.
The previous prime is 1034104397. The next prime is 1034104427. The reversal of 1034104413 is 3144014301.
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 1034104413 - 24 = 1034104397 is a prime.
It is a Duffinian number.
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 1034104413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1034104613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 172350733 + ... + 172350738.
It is an arithmetic number, because the mean of its divisors is an integer number (344701472).
Almost surely, 21034104413 is an apocalyptic number.
It is an amenable number.
1034104413 is a deficient number, since it is larger than the sum of its proper divisors (344701475).
1034104413 is an equidigital number, since it uses as much as digits as its factorization.
1034104413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344701474.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1034104413 is about 32157.4938855627. The cubic root of 1034104413 is about 1011.2412973908.
Adding to 1034104413 its reverse (3144014301), we get a palindrome (4178118714).
The spelling of 1034104413 in words is "one billion, thirty-four million, one hundred four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •