Base | Representation |
---|---|
bin | 1000100000101001010… |
… | …1101101011000011011 |
3 | 111222101002111221222202 |
4 | 2020022111231120123 |
5 | 4343410300214011 |
6 | 151055303440415 |
7 | 13364013323444 |
oct | 2101225553033 |
9 | 458332457882 |
10 | 146202351131 |
11 | 57005463371 |
12 | 24402a5610b |
13 | 10a2c859255 |
14 | 710d2722cb |
15 | 3c0a4ca23b |
hex | 220a56d61b |
146202351131 has 16 divisors (see below), whose sum is σ = 150526237248. Its totient is φ = 141938160000.
The previous prime is 146202351067. The next prime is 146202351157. The reversal of 146202351131 is 131153202641.
It is a cyclic number.
It is not a de Polignac number, because 146202351131 - 26 = 146202351067 is a prime.
It is a super-2 number, since 2×1462023511312 (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 = 146202351094 and 146202351103.
It is not an unprimeable number, because it can be changed into a prime (146202351331) 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, 10040306 + ... + 10054856.
It is an arithmetic number, because the mean of its divisors is an integer number (9407889828).
Almost surely, 2146202351131 is an apocalyptic number.
146202351131 is a deficient number, since it is larger than the sum of its proper divisors (4323886117).
146202351131 is a wasteful number, since it uses less digits than its factorization.
146202351131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16582.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 146202351131 its reverse (131153202641), we get a palindrome (277355553772).
The spelling of 146202351131 in words is "one hundred forty-six billion, two hundred two million, three hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •