Base | Representation |
---|---|
bin | 111111110011010… |
… | …111110011000011 |
3 | 2202121012112212102 |
4 | 333303113303003 |
5 | 4143012301202 |
6 | 254115021015 |
7 | 35345342222 |
oct | 7763276303 |
9 | 2677175772 |
10 | 1070431427 |
11 | 4aa259a7a |
12 | 25a59a76b |
13 | 1409ca1a0 |
14 | a2242cb9 |
15 | 63e94d02 |
hex | 3fcd7cc3 |
1070431427 has 4 divisors (see below), whose sum is σ = 1152772320. Its totient is φ = 988090536.
The previous prime is 1070431409. The next prime is 1070431447. The reversal of 1070431427 is 7241340701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7241340701 = 7 ⋅1034477243.
It is a cyclic number.
It is not a de Polignac number, because 1070431427 - 26 = 1070431363 is a prime.
It is a super-2 number, since 2×10704314272 = 2291646879818512658, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1070431427.
It is not an unprimeable number, because it can be changed into a prime (1070431447) 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, 41170427 + ... + 41170452.
It is an arithmetic number, because the mean of its divisors is an integer number (288193080).
Almost surely, 21070431427 is an apocalyptic number.
1070431427 is a deficient number, since it is larger than the sum of its proper divisors (82340893).
1070431427 is an equidigital number, since it uses as much as digits as its factorization.
1070431427 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82340892.
The product of its (nonzero) digits is 4704, while the sum is 29.
The square root of 1070431427 is about 32717.4483571076. The cubic root of 1070431427 is about 1022.9465698000.
The spelling of 1070431427 in words is "one billion, seventy million, four hundred thirty-one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •