Base | Representation |
---|---|
bin | 100001000001101011000100… |
… | …100001110000101001111111 |
3 | 201001021210221011120010222112 |
4 | 201001223010201300221333 |
5 | 123014241011301404021 |
6 | 1232531054205404235 |
7 | 42411000553105040 |
oct | 4101530441605177 |
9 | 631253834503875 |
10 | 145250501200511 |
11 | 42310434289353 |
12 | 1435a62ab6967b |
13 | 63080a96491a5 |
14 | 27c2239c708c7 |
15 | 11bd473a2ad5b |
hex | 841ac4870a7f |
145250501200511 has 16 divisors (see below), whose sum is σ = 166247232413184. Its totient is φ = 124315442823264.
The previous prime is 145250501200459. The next prime is 145250501200543. The reversal of 145250501200511 is 115002105052541.
It is a de Polignac number, because none of the positive numbers 2k-145250501200511 is a prime.
It is a super-2 number, since 2×1452505012005112 (a number of 29 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 (145250501200591) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 237582926 + ... + 238193508.
It is an arithmetic number, because the mean of its divisors is an integer number (10390452025824).
Almost surely, 2145250501200511 is an apocalyptic number.
145250501200511 is a deficient number, since it is larger than the sum of its proper divisors (20996731212673).
145250501200511 is an equidigital number, since it uses as much as digits as its factorization.
145250501200511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661030.
The product of its (nonzero) digits is 10000, while the sum is 32.
The spelling of 145250501200511 in words is "one hundred forty-five trillion, two hundred fifty billion, five hundred one million, two hundred thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •