Base | Representation |
---|---|
bin | 100000111111110011101110… |
… | …001111010110110100110110 |
3 | 201000211120011020020021101102 |
4 | 200333303232033112310312 |
5 | 123010141034103002220 |
6 | 1232352142123330102 |
7 | 42365513111633336 |
oct | 4077635617266466 |
9 | 630746136207342 |
10 | 145122352000310 |
11 | 42271053410533 |
12 | 14339826080932 |
13 | 62c8c9603cb89 |
14 | 27b9d605030c6 |
15 | 11b9e73407775 |
hex | 83fcee3d6d36 |
145122352000310 has 32 divisors (see below), whose sum is σ = 263730437410752. Its totient is φ = 57493399219200.
The previous prime is 145122352000271. The next prime is 145122352000313. The reversal of 145122352000310 is 13000253221541.
It is a super-2 number, since 2×1451223520003102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145122352000313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 142083887 + ... + 143101626.
It is an arithmetic number, because the mean of its divisors is an integer number (8241576169086).
Almost surely, 2145122352000310 is an apocalyptic number.
145122352000310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145122352000310 is a deficient number, since it is larger than the sum of its proper divisors (118608085410442).
145122352000310 is a wasteful number, since it uses less digits than its factorization.
145122352000310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285186008.
The product of its (nonzero) digits is 7200, while the sum is 29.
The spelling of 145122352000310 in words is "one hundred forty-five trillion, one hundred twenty-two billion, three hundred fifty-two million, three hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •