Base | Representation |
---|---|
bin | 1000011101010100101… |
… | …1100111111101011000 |
3 | 111220001221100222212010 |
4 | 2013111023213331120 |
5 | 4340043442440112 |
6 | 150431004345520 |
7 | 13332633666264 |
oct | 2072513477530 |
9 | 456057328763 |
10 | 145310515032 |
11 | 56697aa7741 |
12 | 241b42452a0 |
13 | 10919b60797 |
14 | 7066a3d0a4 |
15 | 3ba706263c |
hex | 21d52e7f58 |
145310515032 has 128 divisors (see below), whose sum is σ = 370676275200. Its totient is φ = 47461220352.
The previous prime is 145310515027. The next prime is 145310515081. The reversal of 145310515032 is 230515013541.
It is a super-2 number, since 2×1453105150322 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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, 215914248 + ... + 215914920.
It is an arithmetic number, because the mean of its divisors is an integer number (2895908400).
Almost surely, 2145310515032 is an apocalyptic number.
145310515032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
145310515032 is an abundant number, since it is smaller than the sum of its proper divisors (225365760168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145310515032 is a wasteful number, since it uses less digits than its factorization.
145310515032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1457 (or 1453 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 145310515032 its reverse (230515013541), we get a palindrome (375825528573).
The spelling of 145310515032 in words is "one hundred forty-five billion, three hundred ten million, five hundred fifteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •