Base | Representation |
---|---|
bin | 1000011100111010011… |
… | …1000101000010011001 |
3 | 111212210020221001011211 |
4 | 2013032213011002121 |
5 | 4334332232142023 |
6 | 150412025423121 |
7 | 13330124641513 |
oct | 2071647050231 |
9 | 455706831154 |
10 | 145200271513 |
11 | 5664084a0a0 |
12 | 2418333aaa1 |
13 | 1090007162b |
14 | 7056142bb3 |
15 | 3b9c537a0d |
hex | 21ce9c5099 |
145200271513 has 8 divisors (see below), whose sum is σ = 161770515840. Its totient is φ = 129191730480.
The previous prime is 145200271499. The next prime is 145200271577. The reversal of 145200271513 is 315172002541.
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 145200271513 - 217 = 145200140441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145200271613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 140425278 + ... + 140426311.
It is an arithmetic number, because the mean of its divisors is an integer number (20221314480).
Almost surely, 2145200271513 is an apocalyptic number.
It is an amenable number.
145200271513 is a deficient number, since it is larger than the sum of its proper divisors (16570244327).
145200271513 is a wasteful number, since it uses less digits than its factorization.
145200271513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280851647.
The product of its (nonzero) digits is 8400, while the sum is 31.
The spelling of 145200271513 in words is "one hundred forty-five billion, two hundred million, two hundred seventy-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •