Base | Representation |
---|---|
bin | 1000100000110101100… |
… | …1001010010001101001 |
3 | 111222111122221001011022 |
4 | 2020031121022101221 |
5 | 4344011404300221 |
6 | 151104333542225 |
7 | 13365204661004 |
oct | 2101531122151 |
9 | 458448831138 |
10 | 146253587561 |
11 | 57031379024 |
12 | 24418044975 |
13 | 10a3a358373 |
14 | 7115dac53b |
15 | 3c0ec4b4ab |
hex | 220d64a469 |
146253587561 has 4 divisors (see below), whose sum is σ = 146307618192. Its totient is φ = 146199556932.
The previous prime is 146253587551. The next prime is 146253587563. The reversal of 146253587561 is 165785352641.
It is a happy number.
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: 165785352641 = 739 ⋅224337419.
It is a cyclic number.
It is not a de Polignac number, because 146253587561 - 230 = 145179845737 is a prime.
It is a super-2 number, since 2×1462535875612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146253587563) 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, 27011255 + ... + 27016668.
It is an arithmetic number, because the mean of its divisors is an integer number (36576904548).
Almost surely, 2146253587561 is an apocalyptic number.
It is an amenable number.
146253587561 is a deficient number, since it is larger than the sum of its proper divisors (54030631).
146253587561 is an equidigital number, since it uses as much as digits as its factorization.
146253587561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54030630.
The product of its digits is 6048000, while the sum is 53.
The spelling of 146253587561 in words is "one hundred forty-six billion, two hundred fifty-three million, five hundred eighty-seven thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •