Base | Representation |
---|---|
bin | 100110110111010… |
… | …1111110100100011 |
3 | 10100212220011001212 |
4 | 1031232233310203 |
5 | 10132322201011 |
6 | 333223220335 |
7 | 44213445125 |
oct | 11556576443 |
9 | 3325804055 |
10 | 1304100131 |
11 | 60a148804 |
12 | 3048a76ab |
13 | 17a2422a9 |
14 | c52ab215 |
15 | 7975008b |
hex | 4dbafd23 |
1304100131 has 8 divisors (see below), whose sum is σ = 1376424720. Its totient is φ = 1232144352.
The previous prime is 1304100103. The next prime is 1304100167. The reversal of 1304100131 is 1310014031.
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 1304100131 - 230 = 230358307 is a prime.
It is a super-2 number, since 2×13041001312 = 3401354303348434322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1304130131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84920 + ... + 99093.
It is an arithmetic number, because the mean of its divisors is an integer number (172053090).
Almost surely, 21304100131 is an apocalyptic number.
1304100131 is a deficient number, since it is larger than the sum of its proper divisors (72324589).
1304100131 is a wasteful number, since it uses less digits than its factorization.
1304100131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184405.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1304100131 is about 36112.3265797151. The cubic root of 1304100131 is about 1092.5390773009.
Adding to 1304100131 its reverse (1310014031), we get a palindrome (2614114162).
The spelling of 1304100131 in words is "one billion, three hundred four million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •