Base | Representation |
---|---|
bin | 1000100010101011110… |
… | …0111111100101110001 |
3 | 112000210020010000220100 |
4 | 2020222330333211301 |
5 | 4401020334121431 |
6 | 151225451303013 |
7 | 13413406224612 |
oct | 2105274774561 |
9 | 460706100810 |
10 | 146749520241 |
11 | 57266307645 |
12 | 2453614aa69 |
13 | 10ab901805c |
14 | 7161bc5c09 |
15 | 3c3d55e4e6 |
hex | 222af3f971 |
146749520241 has 27 divisors (see below), whose sum is σ = 213653007841. Its totient is φ = 97063024704.
The previous prime is 146749520233. The next prime is 146749520261. The reversal of 146749520241 is 142025947641.
The square root of 146749520241 is 383079.
It is a perfect power (a square), and thus also a powerful number.
146749520241 is a `hidden beast` number, since 1 + 4 + 67 + 49 + 520 + 24 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 828576225 + 145920944016 = 28785^2 + 381996^2 .
It is not a de Polignac number, because 146749520241 - 23 = 146749520233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146749520261) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 171235885 + ... + 171236741.
Almost surely, 2146749520241 is an apocalyptic number.
146749520241 is the 383079-th square number.
146749520241 is the 191540-th centered octagonal number.
It is an amenable number.
146749520241 is a deficient number, since it is larger than the sum of its proper divisors (66903487600).
146749520241 is an frugal number, since it uses more digits than its factorization.
146749520241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2018 (or 1009 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 146749520241 in words is "one hundred forty-six billion, seven hundred forty-nine million, five hundred twenty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •