Base | Representation |
---|---|
bin | 1000100001001101001… |
… | …0100111101010010101 |
3 | 111222202120010011012012 |
4 | 2020103102213222111 |
5 | 4344212222124323 |
6 | 151122230434005 |
7 | 13400516014022 |
oct | 2102322475225 |
9 | 458676104165 |
10 | 146352536213 |
11 | 57082211674 |
12 | 24445202905 |
13 | 10a549c1470 |
14 | 71251a8549 |
15 | 3c18794678 |
hex | 22134a7a95 |
146352536213 has 16 divisors (see below), whose sum is σ = 158176233600. Its totient is φ = 134609967936.
The previous prime is 146352536207. The next prime is 146352536233. The reversal of 146352536213 is 312635253641.
It is a cyclic number.
It is not a de Polignac number, because 146352536213 - 224 = 146335758997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146352536233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22174688 + ... + 22181286.
It is an arithmetic number, because the mean of its divisors is an integer number (9886014600).
Almost surely, 2146352536213 is an apocalyptic number.
146352536213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
146352536213 is a deficient number, since it is larger than the sum of its proper divisors (11823697387).
146352536213 is a wasteful number, since it uses less digits than its factorization.
146352536213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12476.
The product of its digits is 388800, while the sum is 41.
Adding to 146352536213 its reverse (312635253641), we get a palindrome (458987789854).
The spelling of 146352536213 in words is "one hundred forty-six billion, three hundred fifty-two million, five hundred thirty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •