Base | Representation |
---|---|
bin | 1000011100001101011… |
… | …0111111110010010001 |
3 | 111212022002201210000102 |
4 | 2013003112333302101 |
5 | 4333440421200241 |
6 | 150341203502145 |
7 | 13322343315623 |
oct | 2070326776221 |
9 | 455262653012 |
10 | 145011506321 |
11 | 56554240000 |
12 | 24130087955 |
13 | 1089cc1bc56 |
14 | 7039046c13 |
15 | 3b8ab9c39b |
hex | 21c35bfc91 |
145011506321 has 20 divisors (see below), whose sum is σ = 162522190260. Its totient is φ = 129340617120.
The previous prime is 145011506303. The next prime is 145011506383. The reversal of 145011506321 is 123605110541.
It can be written as a sum of positive squares in 2 ways, for example, as 99659544721 + 45351961600 = 315689^2 + 212960^2 .
It is not a de Polignac number, because 145011506321 - 26 = 145011506257 is a prime.
It is not an unprimeable number, because it can be changed into a prime (145011506221) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 682535 + ... + 869411.
It is an arithmetic number, because the mean of its divisors is an integer number (8126109513).
Almost surely, 2145011506321 is an apocalyptic number.
145011506321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
145011506321 is a deficient number, since it is larger than the sum of its proper divisors (17510683939).
145011506321 is an frugal number, since it uses more digits than its factorization.
145011506321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186974 (or 186941 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 145011506321 its reverse (123605110541), we get a palindrome (268616616862).
The spelling of 145011506321 in words is "one hundred forty-five billion, eleven million, five hundred six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •