Base | Representation |
---|---|
bin | 100001001111111101011011… |
… | …001111001011011101000001 |
3 | 201011202200002011210002222210 |
4 | 201033331123033023131001 |
5 | 123131332203222421031 |
6 | 1235002103312252333 |
7 | 42541635163144503 |
oct | 4117753317133501 |
9 | 634680064702883 |
10 | 146232282232641 |
11 | 42659843064000 |
12 | 144989675410a9 |
13 | 6379850218767 |
14 | 281797476bd73 |
15 | 11d8c85a84746 |
hex | 84ff5b3cb741 |
146232282232641 has 32 divisors (see below), whose sum is σ = 216582725725056. Its totient is φ = 87748143912000.
The previous prime is 146232282232549. The next prime is 146232282232657.
146232282232641 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 146232282232641 - 29 = 146232282232129 is a prime.
It is not an unprimeable number, because it can be changed into a prime (146232282230641) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 180894526 + ... + 181701111.
It is an arithmetic number, because the mean of its divisors is an integer number (6768210178908).
Almost surely, 2146232282232641 is an apocalyptic number.
146232282232641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
146232282232641 is a deficient number, since it is larger than the sum of its proper divisors (70350443492415).
146232282232641 is a wasteful number, since it uses less digits than its factorization.
146232282232641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362595774 (or 362595752 counting only the distinct ones).
The product of its digits is 2654208, while the sum is 48.
The spelling of 146232282232641 in words is "one hundred forty-six trillion, two hundred thirty-two billion, two hundred eighty-two million, two hundred thirty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •