Base | Representation |
---|---|
bin | 1000011101111001100… |
… | …1011010110110111011 |
3 | 111220110201022001200112 |
4 | 2013132121122312323 |
5 | 4340403033020311 |
6 | 150454210254535 |
7 | 13336522113140 |
oct | 2073631326673 |
9 | 456421261615 |
10 | 145465126331 |
11 | 567672a9478 |
12 | 24237b8744b |
13 | 10942bb5565 |
14 | 707d3a83c7 |
15 | 3bb590328b |
hex | 21de65adbb |
145465126331 has 16 divisors (see below), whose sum is σ = 172156554240. Its totient is φ = 120260276640.
The previous prime is 145465126277. The next prime is 145465126333. The reversal of 145465126331 is 133621564541.
It is not a de Polignac number, because 145465126331 - 226 = 145398017467 is a prime.
It is a super-2 number, since 2×1454651263312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145465126333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 174215 + ... + 566816.
It is an arithmetic number, because the mean of its divisors is an integer number (10759784640).
Almost surely, 2145465126331 is an apocalyptic number.
145465126331 is a deficient number, since it is larger than the sum of its proper divisors (26691427909).
145465126331 is an equidigital number, since it uses as much as digits as its factorization.
145465126331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 742034.
The product of its digits is 259200, while the sum is 41.
The spelling of 145465126331 in words is "one hundred forty-five billion, four hundred sixty-five million, one hundred twenty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •