Base | Representation |
---|---|
bin | 1000100000010011111… |
… | …1001001010110011101 |
3 | 111222010211112121102002 |
4 | 2020010333021112131 |
5 | 4343214303102201 |
6 | 151042335012045 |
7 | 13361543120444 |
oct | 2100477112635 |
9 | 458124477362 |
10 | 146112550301 |
11 | 56a697a8703 |
12 | 2439896a025 |
13 | 10a17076b73 |
14 | 7101377d5b |
15 | 3c0268c76b |
hex | 2204fc959d |
146112550301 has 4 divisors (see below), whose sum is σ = 146193232704. Its totient is φ = 146031867900.
The previous prime is 146112550291. The next prime is 146112550327. The reversal of 146112550301 is 103055211641.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 103055211641 = 17 ⋅6062071273.
It is a cyclic number.
It is not a de Polignac number, because 146112550301 - 234 = 128932681117 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 (146112550601) 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, 40338485 + ... + 40342106.
It is an arithmetic number, because the mean of its divisors is an integer number (36548308176).
Almost surely, 2146112550301 is an apocalyptic number.
It is an amenable number.
146112550301 is a deficient number, since it is larger than the sum of its proper divisors (80682403).
146112550301 is an equidigital number, since it uses as much as digits as its factorization.
146112550301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80682402.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 146112550301 its reverse (103055211641), we get a palindrome (249167761942).
The spelling of 146112550301 in words is "one hundred forty-six billion, one hundred twelve million, five hundred fifty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •