Base | Representation |
---|---|
bin | 1000100101100101… |
… | …0011010101111101 |
3 | 12221122110210102002 |
4 | 2021121103111331 |
5 | 14210102031141 |
6 | 1020422312045 |
7 | 111060060314 |
oct | 21131232575 |
9 | 5848423362 |
10 | 2305111421 |
11 | a831a2368 |
12 | 543b88625 |
13 | 2a9744872 |
14 | 17c1dd27b |
15 | d7580e9b |
hex | 8965357d |
2305111421 has 2 divisors, whose sum is σ = 2305111422. Its totient is φ = 2305111420.
The previous prime is 2305111411. The next prime is 2305111477. The reversal of 2305111421 is 1241115032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2304960100 + 151321 = 48010^2 + 389^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2305111421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2305111393 and 2305111402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2305111411) 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 as a sum of consecutive naturals, namely, 1152555710 + 1152555711.
It is an arithmetic number, because the mean of its divisors is an integer number (1152555711).
Almost surely, 22305111421 is an apocalyptic number.
It is an amenable number.
2305111421 is a deficient number, since it is larger than the sum of its proper divisors (1).
2305111421 is an equidigital number, since it uses as much as digits as its factorization.
2305111421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 2305111421 is about 48011.5759062333. The cubic root of 2305111421 is about 1320.9832399137.
Adding to 2305111421 its reverse (1241115032), we get a palindrome (3546226453).
The spelling of 2305111421 in words is "two billion, three hundred five million, one hundred eleven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •