Base | Representation |
---|---|
bin | 1000011110110011110… |
… | …0000101110000000000 |
3 | 111221002201101000001211 |
4 | 2013230330011300000 |
5 | 4341403012032221 |
6 | 150534323335504 |
7 | 13345543610605 |
oct | 2075474056000 |
9 | 457081330054 |
10 | 145709095936 |
11 | 56881a93448 |
12 | 242a5821594 |
13 | 109815c6181 |
14 | 70a39546ac |
15 | 3bcc0456e1 |
hex | 21ecf05c00 |
145709095936 has 44 divisors (see below), whose sum is σ = 301319955720. Its totient is φ = 70342307840.
The previous prime is 145709095933. The next prime is 145709095967. The reversal of 145709095936 is 639590907541.
It is a happy number.
It is a super-2 number, since 2×1457090959362 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (58).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145709095933) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2423650 + ... + 2483041.
Almost surely, 2145709095936 is an apocalyptic number.
145709095936 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
145709095936 is an abundant number, since it is smaller than the sum of its proper divisors (155610859784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145709095936 is an equidigital number, since it uses as much as digits as its factorization.
145709095936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4906740 (or 4906722 counting only the distinct ones).
The product of its (nonzero) digits is 9185400, while the sum is 58.
The spelling of 145709095936 in words is "one hundred forty-five billion, seven hundred nine million, ninety-five thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •