Base | Representation |
---|---|
bin | 1000011101010011011… |
… | …0100110010000001101 |
3 | 111220001112222221210120 |
4 | 2013110312212100031 |
5 | 4340041040044041 |
6 | 150430250255153 |
7 | 13332536101263 |
oct | 2072466462015 |
9 | 456045887716 |
10 | 145305003021 |
11 | 56694982462 |
12 | 241b24274b9 |
13 | 10918980939 |
14 | 7066006433 |
15 | 3ba6824366 |
hex | 21d4da640d |
145305003021 has 16 divisors (see below), whose sum is σ = 204599195136. Its totient is φ = 91541894576.
The previous prime is 145305002993. The next prime is 145305003083. The reversal of 145305003021 is 120300503541.
It is a cyclic number.
It is not a de Polignac number, because 145305003021 - 26 = 145305002957 is a prime.
It is a super-2 number, since 2×1453050030212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145305002982 and 145305003000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145305003821) 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 15 ways as a sum of consecutive naturals, for example, 12680235 + ... + 12691688.
It is an arithmetic number, because the mean of its divisors is an integer number (12787449696).
Almost surely, 2145305003021 is an apocalyptic number.
It is an amenable number.
145305003021 is a deficient number, since it is larger than the sum of its proper divisors (59294192115).
145305003021 is a wasteful number, since it uses less digits than its factorization.
145305003021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25372032.
The product of its (nonzero) digits is 1800, while the sum is 24.
Adding to 145305003021 its reverse (120300503541), we get a palindrome (265605506562).
The spelling of 145305003021 in words is "one hundred forty-five billion, three hundred five million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •