Base | Representation |
---|---|
bin | 1000011101011101000… |
… | …0011010110110110001 |
3 | 111220011100212121020020 |
4 | 2013113100122312301 |
5 | 4340131400422023 |
6 | 150434250434053 |
7 | 13333535614422 |
oct | 2072720326661 |
9 | 456140777206 |
10 | 145345326513 |
11 | 56705714062 |
12 | 24203a32929 |
13 | 1092412b7aa |
14 | 706b501649 |
15 | 3baa13bde3 |
hex | 21d741adb1 |
145345326513 has 48 divisors (see below), whose sum is σ = 216747912960. Its totient is φ = 86322857472.
The previous prime is 145345326499. The next prime is 145345326541. The reversal of 145345326513 is 315623543541.
It is a happy number.
145345326513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 145345326513 - 218 = 145345064369 is a prime.
It is a super-2 number, since 2×1453453265132 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145345326593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 27374503 + ... + 27379811.
It is an arithmetic number, because the mean of its divisors is an integer number (4515581520).
Almost surely, 2145345326513 is an apocalyptic number.
It is an amenable number.
145345326513 is a deficient number, since it is larger than the sum of its proper divisors (71402586447).
145345326513 is a wasteful number, since it uses less digits than its factorization.
145345326513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6854 (or 6835 counting only the distinct ones).
The product of its digits is 648000, while the sum is 42.
The spelling of 145345326513 in words is "one hundred forty-five billion, three hundred forty-five million, three hundred twenty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •