Base | Representation |
---|---|
bin | 1000011110100011100… |
… | …1101110000000010000 |
3 | 111220220222220221101220 |
4 | 2013220321232000100 |
5 | 4341233142144040 |
6 | 150523503525040 |
7 | 13344062116050 |
oct | 2075071560020 |
9 | 456828827356 |
10 | 145641365520 |
11 | 568478325a2 |
12 | 24286bb9780 |
13 | 109705706c1 |
14 | 7098963560 |
15 | 3bc61172d0 |
hex | 21e8e6e010 |
145641365520 has 160 divisors (see below), whose sum is σ = 520996749312. Its totient is φ = 32966217216.
The previous prime is 145641365483. The next prime is 145641365563. The reversal of 145641365520 is 25563146541.
It is a super-2 number, since 2×1456413655202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 247792 + ... + 593871.
Almost surely, 2145641365520 is an apocalyptic number.
145641365520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145641365520 is an abundant number, since it is smaller than the sum of its proper divisors (375355383792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145641365520 is a wasteful number, since it uses less digits than its factorization.
145641365520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841789 (or 841783 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 145641365520 in words is "one hundred forty-five billion, six hundred forty-one million, three hundred sixty-five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •