Base | Representation |
---|---|
bin | 1000101101111110… |
… | …1110100010110011 |
3 | 20001002210002211111 |
4 | 2023133232202303 |
5 | 14243112201011 |
6 | 1024121454151 |
7 | 111665435140 |
oct | 21337564263 |
9 | 6032702744 |
10 | 2340350131 |
11 | aa1080769 |
12 | 553941357 |
13 | 2b3b32182 |
14 | 182b733c7 |
15 | da6e2121 |
hex | 8b7ee8b3 |
2340350131 has 8 divisors (see below), whose sum is σ = 2674978560. Its totient is φ = 2005794888.
The previous prime is 2340350107. The next prime is 2340350147. The reversal of 2340350131 is 1310530432.
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 2340350131 - 215 = 2340317363 is a prime.
It is a super-2 number, since 2×23403501312 = 10954477471343434322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2340350161) 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, 114810 + ... + 133648.
It is an arithmetic number, because the mean of its divisors is an integer number (334372320).
Almost surely, 22340350131 is an apocalyptic number.
2340350131 is a deficient number, since it is larger than the sum of its proper divisors (334628429).
2340350131 is a wasteful number, since it uses less digits than its factorization.
2340350131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36593.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 2340350131 is about 48377.1653882284. The cubic root of 2340350131 is about 1327.6806073348.
Adding to 2340350131 its reverse (1310530432), we get a palindrome (3650880563).
The spelling of 2340350131 in words is "two billion, three hundred forty million, three hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •