Base | Representation |
---|---|
bin | 1000011101011010001… |
… | …1100001001101111000 |
3 | 111220010112201121020120 |
4 | 2013112203201031320 |
5 | 4340120342243323 |
6 | 150433150253240 |
7 | 13333333562340 |
oct | 2072643411570 |
9 | 456115647216 |
10 | 145333556088 |
11 | 566aa004836 |
12 | 241bbab7220 |
13 | 1092186a146 |
14 | 7069b19d20 |
15 | 3ba90b45e3 |
hex | 21d68e1378 |
145333556088 has 64 divisors (see below), whose sum is σ = 415495672320. Its totient is φ = 41498179200.
The previous prime is 145333556083. The next prime is 145333556117. The reversal of 145333556088 is 880655333541.
It is a super-2 number, since 2×1453335560882 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 145333556088.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145333556083) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5493 + ... + 539163.
It is an arithmetic number, because the mean of its divisors is an integer number (6492119880).
Almost surely, 2145333556088 is an apocalyptic number.
It is an amenable number.
145333556088 is an abundant number, since it is smaller than the sum of its proper divisors (270162116232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145333556088 is a wasteful number, since it uses less digits than its factorization.
145333556088 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535308 (or 535304 counting only the distinct ones).
The product of its (nonzero) digits is 5184000, while the sum is 51.
The spelling of 145333556088 in words is "one hundred forty-five billion, three hundred thirty-three million, five hundred fifty-six thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •