Base | Representation |
---|---|
bin | 1000011101100111110… |
… | …0100011111101110000 |
3 | 111220021111210020120111 |
4 | 2013121330203331300 |
5 | 4340224423440332 |
6 | 150442541551104 |
7 | 13334624312350 |
oct | 2073174437560 |
9 | 456244706514 |
10 | 145390452592 |
11 | 56729135a40 |
12 | 24216b75494 |
13 | 1093059b608 |
14 | 70734cab60 |
15 | 3bae0a2947 |
hex | 21d9f23f70 |
145390452592 has 80 divisors (see below), whose sum is σ = 351772128000. Its totient is φ = 56553822720.
The previous prime is 145390452583. The next prime is 145390452593. The reversal of 145390452592 is 295254093541.
It is a super-2 number, since 2×1453904525922 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145390452593) 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, 667284 + ... + 857932.
It is an arithmetic number, because the mean of its divisors is an integer number (4397151600).
Almost surely, 2145390452592 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145390452592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175886064000).
145390452592 is an abundant number, since it is smaller than the sum of its proper divisors (206381675408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145390452592 is a wasteful number, since it uses less digits than its factorization.
145390452592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191294 (or 191288 counting only the distinct ones).
The product of its (nonzero) digits is 1944000, while the sum is 49.
The spelling of 145390452592 in words is "one hundred forty-five billion, three hundred ninety million, four hundred fifty-two thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •