Base | Representation |
---|---|
bin | 1000100000010011011… |
… | …1000100010001001011 |
3 | 111222010200120000002202 |
4 | 2020010313010101023 |
5 | 4343213232313311 |
6 | 151042221350415 |
7 | 13361516116553 |
oct | 2100467042113 |
9 | 458120500082 |
10 | 146110432331 |
11 | 56a68591416 |
12 | 2439810840b |
13 | 10a167b4b26 |
14 | 7100d86163 |
15 | 3c023bee3b |
hex | 2204dc444b |
146110432331 has 8 divisors (see below), whose sum is σ = 147029132880. Its totient is φ = 145194446848.
The previous prime is 146110432291. The next prime is 146110432337. The reversal of 146110432331 is 133234011641.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146110432331 - 226 = 146043323467 is a prime.
It is a super-2 number, since 2×1461104323312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146110432294 and 146110432303.
It is not an unprimeable number, because it can be changed into a prime (146110432337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 570746 + ... + 786111.
It is an arithmetic number, because the mean of its divisors is an integer number (18378641610).
Almost surely, 2146110432331 is an apocalyptic number.
146110432331 is a deficient number, since it is larger than the sum of its proper divisors (918700549).
146110432331 is a wasteful number, since it uses less digits than its factorization.
146110432331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1357533.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 146110432331 its reverse (133234011641), we get a palindrome (279344443972).
The spelling of 146110432331 in words is "one hundred forty-six billion, one hundred ten million, four hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •