Base | Representation |
---|---|
bin | 100001010100100110100100… |
… | …100100011100110000111001 |
3 | 201012220011121212111101120222 |
4 | 201110212210210130300321 |
5 | 123202044121033001431 |
6 | 1235404431202225425 |
7 | 42603661553402222 |
oct | 4124464444346071 |
9 | 635804555441528 |
10 | 146551340125241 |
11 | 4277208aa08067 |
12 | 1452a76b355275 |
13 | 63a09694a479c |
14 | 28291a09d8249 |
15 | 11e220b41657b |
hex | 8549a491cc39 |
146551340125241 has 8 divisors (see below), whose sum is σ = 150965950502400. Its totient is φ = 142182477006192.
The previous prime is 146551340125231. The next prime is 146551340125249. The reversal of 146551340125241 is 142521043155641.
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 146551340125241 - 214 = 146551340108857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 146551340125192 and 146551340125201.
It is not an unprimeable number, because it can be changed into a prime (146551340125249) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11436808025 + ... + 11436820838.
It is an arithmetic number, because the mean of its divisors is an integer number (18870743812800).
Almost surely, 2146551340125241 is an apocalyptic number.
It is an amenable number.
146551340125241 is a deficient number, since it is larger than the sum of its proper divisors (4414610377159).
146551340125241 is a wasteful number, since it uses less digits than its factorization.
146551340125241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22873629055.
The product of its (nonzero) digits is 576000, while the sum is 44.
The spelling of 146551340125241 in words is "one hundred forty-six trillion, five hundred fifty-one billion, three hundred forty million, one hundred twenty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •