Base | Representation |
---|---|
bin | 100001010001001001001100… |
… | …010000010110111001100101 |
3 | 201012001110001210212012102012 |
4 | 201101021030100112321211 |
5 | 123134200311111341203 |
6 | 1235103320042124005 |
7 | 42550545164402330 |
oct | 4121111420267145 |
9 | 635043053765365 |
10 | 146313635262053 |
11 | 4269029a798106 |
12 | 144b06904b0605 |
13 | 638441676479c |
14 | 281b8910ad617 |
15 | 11dae47c1abd8 |
hex | 85124c416e65 |
146313635262053 has 16 divisors (see below), whose sum is σ = 173016451104000. Its totient is φ = 121062777075072.
The previous prime is 146313635261999. The next prime is 146313635262061. The reversal of 146313635262053 is 350262536313641.
It is not a de Polignac number, because 146313635262053 - 228 = 146313366826597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146313635261992 and 146313635262010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146313635252053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71516633 + ... + 73534046.
It is an arithmetic number, because the mean of its divisors is an integer number (10813528194000).
Almost surely, 2146313635262053 is an apocalyptic number.
It is an amenable number.
146313635262053 is a deficient number, since it is larger than the sum of its proper divisors (26702815841947).
146313635262053 is a wasteful number, since it uses less digits than its factorization.
146313635262053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145055684.
The product of its (nonzero) digits is 6998400, while the sum is 50.
The spelling of 146313635262053 in words is "one hundred forty-six trillion, three hundred thirteen billion, six hundred thirty-five million, two hundred sixty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •