Base | Representation |
---|---|
bin | 1000011110011010100… |
… | …0101101001011001001 |
3 | 111220211100101121121122 |
4 | 2013212220231023021 |
5 | 4341143424214431 |
6 | 150520025045025 |
7 | 13343121031205 |
oct | 2074650551311 |
9 | 456740347548 |
10 | 145603351241 |
11 | 56828328937 |
12 | 24276326775 |
13 | 1096572094a |
14 | 70938a9b05 |
15 | 3bc2b08a7b |
hex | 21e6a2d2c9 |
145603351241 has 4 divisors (see below), whose sum is σ = 145609006032. Its totient is φ = 145597696452.
The previous prime is 145603351199. The next prime is 145603351261. The reversal of 145603351241 is 142153306541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 145603351241 - 214 = 145603334857 is a prime.
It is a super-2 number, since 2×1456033512412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (145603351261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2788595 + ... + 2840328.
It is an arithmetic number, because the mean of its divisors is an integer number (36402251508).
Almost surely, 2145603351241 is an apocalyptic number.
It is an amenable number.
145603351241 is a deficient number, since it is larger than the sum of its proper divisors (5654791).
145603351241 is an equidigital number, since it uses as much as digits as its factorization.
145603351241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5654790.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 145603351241 its reverse (142153306541), we get a palindrome (287756657782).
The spelling of 145603351241 in words is "one hundred forty-five billion, six hundred three million, three hundred fifty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •