Base | Representation |
---|---|
bin | 1000100001111111011… |
… | …0110111101100001001 |
3 | 112000022020211101210112 |
4 | 2020133312313230021 |
5 | 4400130210200031 |
6 | 151155201324105 |
7 | 13405656024050 |
oct | 2103766675411 |
9 | 460266741715 |
10 | 146563365641 |
11 | 57180220970 |
12 | 244a3936635 |
13 | 10a8959a9c4 |
14 | 71451a9397 |
15 | 3c2c03c62b |
hex | 221fdb7b09 |
146563365641 has 16 divisors (see below), whose sum is σ = 182743237248. Its totient is φ = 114195916800.
The previous prime is 146563365629. The next prime is 146563365643.
146563365641 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 146563365641 - 222 = 146559171337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 146563365641.
It is not an unprimeable number, because it can be changed into a prime (146563365643) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 964151 + ... + 1105763.
It is an arithmetic number, because the mean of its divisors is an integer number (11421452328).
Almost surely, 2146563365641 is an apocalyptic number.
146563365641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
146563365641 is a deficient number, since it is larger than the sum of its proper divisors (36179871607).
146563365641 is a wasteful number, since it uses less digits than its factorization.
146563365641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155072.
The product of its digits is 4665600, while the sum is 50.
The spelling of 146563365641 in words is "one hundred forty-six billion, five hundred sixty-three million, three hundred sixty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •