Base | Representation |
---|---|
bin | 1000100001010011111… |
… | …0101001110101111101 |
3 | 111222211112101222121011 |
4 | 2020110332221311331 |
5 | 4344241444403301 |
6 | 151125121435221 |
7 | 13401311516032 |
oct | 2102476516575 |
9 | 458745358534 |
10 | 146380856701 |
11 | 570971a5232 |
12 | 2445279bb11 |
13 | 10a5a828b51 |
14 | 7128c5b389 |
15 | 3c1aedaa51 |
hex | 2214fa9d7d |
146380856701 has 4 divisors (see below), whose sum is σ = 146602311004. Its totient is φ = 146159402400.
The previous prime is 146380856639. The next prime is 146380856719. The reversal of 146380856701 is 107658083641.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 107658083641 = 53 ⋅2031284597.
It can be written as a sum of positive squares in 2 ways, for example, as 130328220100 + 16052636601 = 361010^2 + 126699^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146380856701 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 (146380856731) 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, 110726160 + ... + 110727481.
It is an arithmetic number, because the mean of its divisors is an integer number (36650577751).
Almost surely, 2146380856701 is an apocalyptic number.
It is an amenable number.
146380856701 is a deficient number, since it is larger than the sum of its proper divisors (221454303).
146380856701 is an equidigital number, since it uses as much as digits as its factorization.
146380856701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221454302.
The product of its (nonzero) digits is 967680, while the sum is 49.
The spelling of 146380856701 in words is "one hundred forty-six billion, three hundred eighty million, eight hundred fifty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •