Base | Representation |
---|---|
bin | 110111110010000001111011… |
… | …010101101100011101110011 |
3 | 1012011122101011102012220000011 |
4 | 313302001323111230131303 |
5 | 224123444032403412433 |
6 | 2225435153342035351 |
7 | 102450360000265522 |
oct | 6762017325543563 |
9 | 1164571142186004 |
10 | 245330601232243 |
11 | 7119613a70495a |
12 | 23622869b78b57 |
13 | a6b776554bcc7 |
14 | 44820c8c1a4b9 |
15 | 1d5692a4783cd |
hex | df207b56c773 |
245330601232243 has 2 divisors, whose sum is σ = 245330601232244. Its totient is φ = 245330601232242.
The previous prime is 245330601232237. The next prime is 245330601232289. The reversal of 245330601232243 is 342232106033542.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 245330601232243 - 217 = 245330601101171 is a prime.
It is a super-2 number, since 2×2453306012322432 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 245330601232196 and 245330601232205.
It is not a weakly prime, because it can be changed into another prime (245330601235243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122665300616121 + 122665300616122.
It is an arithmetic number, because the mean of its divisors is an integer number (122665300616122).
Almost surely, 2245330601232243 is an apocalyptic number.
245330601232243 is a deficient number, since it is larger than the sum of its proper divisors (1).
245330601232243 is an equidigital number, since it uses as much as digits as its factorization.
245330601232243 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 622080, while the sum is 40.
Adding to 245330601232243 its reverse (342232106033542), we get a palindrome (587562707265785).
The spelling of 245330601232243 in words is "two hundred forty-five trillion, three hundred thirty billion, six hundred one million, two hundred thirty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •