Base | Representation |
---|---|
bin | 1000100001111001111… |
… | …1011110111100101101 |
3 | 112000020122201120002222 |
4 | 2020132133132330231 |
5 | 4400103324122043 |
6 | 151153022325125 |
7 | 13405260224213 |
oct | 2103637367455 |
9 | 460218646088 |
10 | 146540457773 |
11 | 571692a4946 |
12 | 244981297a5 |
13 | 10a84909b58 |
14 | 7142124cb3 |
15 | 3c2a014d68 |
hex | 221e7def2d |
146540457773 has 8 divisors (see below), whose sum is σ = 154396364928. Its totient is φ = 138808265904.
The previous prime is 146540457697. The next prime is 146540457797. The reversal of 146540457773 is 377754045641.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146540457773 - 28 = 146540457517 is a prime.
It is a super-2 number, since 2×1465404577732 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146540451773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30926390 + ... + 30931127.
It is an arithmetic number, because the mean of its divisors is an integer number (19299545616).
Almost surely, 2146540457773 is an apocalyptic number.
It is an amenable number.
146540457773 is a deficient number, since it is larger than the sum of its proper divisors (7855907155).
146540457773 is a wasteful number, since it uses less digits than its factorization.
146540457773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61857643.
The product of its (nonzero) digits is 9878400, while the sum is 53.
The spelling of 146540457773 in words is "one hundred forty-six billion, five hundred forty million, four hundred fifty-seven thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •