Base | Representation |
---|---|
bin | 1000100110001100… |
… | …1011100111111001 |
3 | 12221211100100222100 |
4 | 2021203023213321 |
5 | 14211232414431 |
6 | 1020554014013 |
7 | 111121064646 |
oct | 21143134771 |
9 | 5854310870 |
10 | 2307701241 |
11 | a8470110a |
12 | 544a17309 |
13 | 2aa1405c1 |
14 | 17c6b4dcd |
15 | d78e34e6 |
hex | 898cb9f9 |
2307701241 has 12 divisors (see below), whose sum is σ = 3333762900. Its totient is φ = 1538275200.
The previous prime is 2307701237. The next prime is 2307701243. The reversal of 2307701241 is 1421077032.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 2117840400 + 189860841 = 46020^2 + 13779^2 .
It is not a de Polignac number, because 2307701241 - 22 = 2307701237 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2307701243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 130285 + ... + 146933.
It is an arithmetic number, because the mean of its divisors is an integer number (277813575).
Almost surely, 22307701241 is an apocalyptic number.
It is an amenable number.
2307701241 is a deficient number, since it is larger than the sum of its proper divisors (1026061659).
2307701241 is a wasteful number, since it uses less digits than its factorization.
2307701241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32056 (or 32053 counting only the distinct ones).
The product of its (nonzero) digits is 2352, while the sum is 27.
The square root of 2307701241 is about 48038.5391222506. The cubic root of 2307701241 is about 1321.4777681989.
Adding to 2307701241 its reverse (1421077032), we get a palindrome (3728778273).
The spelling of 2307701241 in words is "two billion, three hundred seven million, seven hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •