Base | Representation |
---|---|
bin | 111110000011001… |
… | …101000011110010 |
3 | 2200112212200000012 |
4 | 332003031003302 |
5 | 4113000333224 |
6 | 251144454522 |
7 | 34540405025 |
oct | 7603150362 |
9 | 2615780005 |
10 | 1041027314 |
11 | 4946a6258 |
12 | 25077a442 |
13 | 1378a34c2 |
14 | 9c38b1bc |
15 | 615d780e |
hex | 3e0cd0f2 |
1041027314 has 4 divisors (see below), whose sum is σ = 1561540974. Its totient is φ = 520513656.
The previous prime is 1041027313. The next prime is 1041027331. The reversal of 1041027314 is 4137201401.
It is a happy number.
1041027314 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 4137201401 = 89 ⋅46485409.
It can be written as a sum of positive squares in only one way, i.e., 854568289 + 186459025 = 29233^2 + 13655^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1041027314.
It is not an unprimeable number, because it can be changed into a prime (1041027313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 260256827 + ... + 260256830.
Almost surely, 21041027314 is an apocalyptic number.
1041027314 is a deficient number, since it is larger than the sum of its proper divisors (520513660).
1041027314 is an equidigital number, since it uses as much as digits as its factorization.
1041027314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 520513659.
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 1041027314 is about 32264.9548891673. The cubic root of 1041027314 is about 1013.4928943059.
Adding to 1041027314 its reverse (4137201401), we get a palindrome (5178228715).
The spelling of 1041027314 in words is "one billion, forty-one million, twenty-seven thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •