Base | Representation |
---|---|
bin | 100101111110000… |
… | …1010000101001011 |
3 | 10021210101000022022 |
4 | 1023330022011023 |
5 | 10102124424011 |
6 | 330231315055 |
7 | 43400224640 |
oct | 11374120513 |
9 | 3253330268 |
10 | 1274061131 |
11 | 5a41a0a92 |
12 | 2b681ba8b |
13 | 173c55635 |
14 | c12cbdc7 |
15 | 76cb98db |
hex | 4bf0a14b |
1274061131 has 8 divisors (see below), whose sum is σ = 1532705280. Its totient is φ = 1034575848.
The previous prime is 1274061127. The next prime is 1274061137. The reversal of 1274061131 is 1311604721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1274061131 - 22 = 1274061127 is a prime.
It is a super-2 number, since 2×12740611312 = 3246463531049998322, 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 1274061131.
It is not an unprimeable number, because it can be changed into a prime (1274061137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4789571 + ... + 4789836.
It is an arithmetic number, because the mean of its divisors is an integer number (191588160).
Almost surely, 21274061131 is an apocalyptic number.
1274061131 is a deficient number, since it is larger than the sum of its proper divisors (258644149).
1274061131 is an equidigital number, since it uses as much as digits as its factorization.
1274061131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9579433.
The product of its (nonzero) digits is 1008, while the sum is 26.
The square root of 1274061131 is about 35693.9929259813. The cubic root of 1274061131 is about 1084.0852167567.
Adding to 1274061131 its reverse (1311604721), we get a palindrome (2585665852).
The spelling of 1274061131 in words is "one billion, two hundred seventy-four million, sixty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •