Base | Representation |
---|---|
bin | 1000011100111011101… |
… | …1001101111111000000 |
3 | 111212210121212021022212 |
4 | 2013032323031333000 |
5 | 4334340110113130 |
6 | 150412334521252 |
7 | 13330220550644 |
oct | 2071673157700 |
9 | 455717767285 |
10 | 145205551040 |
11 | 56643825740 |
12 | 24185066228 |
13 | 1090119c704 |
14 | 7056b18c24 |
15 | 3b9cc2be95 |
hex | 21ceecdfc0 |
145205551040 has 112 divisors (see below), whose sum is σ = 385977018240. Its totient is φ = 51574010880.
The previous prime is 145205550977. The next prime is 145205551063. The reversal of 145205551040 is 40155502541.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 145205550988 and 145205551006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 328310 + ... + 631029.
Almost surely, 2145205551040 is an apocalyptic number.
145205551040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145205551040 is an abundant number, since it is smaller than the sum of its proper divisors (240771467200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145205551040 is a wasteful number, since it uses less digits than its factorization.
145205551040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 959410 (or 959400 counting only the distinct ones).
The product of its (nonzero) digits is 20000, while the sum is 32.
The spelling of 145205551040 in words is "one hundred forty-five billion, two hundred five million, five hundred fifty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •