Base | Representation |
---|---|
bin | 100001010110000111011010… |
… | …100111100101001111000000 |
3 | 201020021010000211111210222122 |
4 | 201112013122213211033000 |
5 | 123210300101442144021 |
6 | 1235524305435223412 |
7 | 42614332461021164 |
oct | 4126073247451700 |
9 | 636233024453878 |
10 | 146655326131136 |
11 | 428021a1339409 |
12 | 1454694bba7b68 |
13 | 63aa6cba460a4 |
14 | 28302271a8ca4 |
15 | 11e4c9555ebab |
hex | 8561da9e53c0 |
146655326131136 has 14 divisors (see below), whose sum is σ = 291019162791600. Its totient is φ = 73327663065536.
The previous prime is 146655326131133. The next prime is 146655326131157. The reversal of 146655326131136 is 631131623556641.
146655326131136 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146655326131133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1145744735336 + ... + 1145744735463.
Almost surely, 2146655326131136 is an apocalyptic number.
146655326131136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
146655326131136 is a deficient number, since it is larger than the sum of its proper divisors (144363836660464).
146655326131136 is an equidigital number, since it uses as much as digits as its factorization.
146655326131136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2291489470811 (or 2291489470801 counting only the distinct ones).
The product of its digits is 6998400, while the sum is 53.
Adding to 146655326131136 its reverse (631131623556641), we get a palindrome (777786949687777).
The spelling of 146655326131136 in words is "one hundred forty-six trillion, six hundred fifty-five billion, three hundred twenty-six million, one hundred thirty-one thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •