Base | Representation |
---|---|
bin | 100001011000010101110100… |
… | …000101110001111101010111 |
3 | 201020210201200121100211022021 |
4 | 201120111310011301331113 |
5 | 123220301221023120413 |
6 | 1240122433432514011 |
7 | 42631354445300452 |
oct | 4130256405617527 |
9 | 636721617324267 |
10 | 146808224816983 |
11 | 428610226990a4 |
12 | 1457050154b907 |
13 | 63bbc579c6072 |
14 | 28377ad90c499 |
15 | 11e8c4386e18d |
hex | 858574171f57 |
146808224816983 has 4 divisors (see below), whose sum is σ = 146820888351808. Its totient is φ = 146795561282160.
The previous prime is 146808224816959. The next prime is 146808224817019. The reversal of 146808224816983 is 389618422808641.
146808224816983 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 146808224816983 - 217 = 146808224685911 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146808224516983) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6331750023 + ... + 6331773208.
It is an arithmetic number, because the mean of its divisors is an integer number (36705222087952).
Almost surely, 2146808224816983 is an apocalyptic number.
146808224816983 is a deficient number, since it is larger than the sum of its proper divisors (12663534825).
146808224816983 is a wasteful number, since it uses less digits than its factorization.
146808224816983 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12663534824.
The product of its (nonzero) digits is 254803968, while the sum is 70.
The spelling of 146808224816983 in words is "one hundred forty-six trillion, eight hundred eight billion, two hundred twenty-four million, eight hundred sixteen thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •