Base | Representation |
---|---|
bin | 100001000100100101111011… |
… | …110001011000000010100010 |
3 | 201001222222211022102110012222 |
4 | 201010211323301120002202 |
5 | 123031032420332121010 |
6 | 1233203155541351042 |
7 | 42431332640661524 |
oct | 4104457361300242 |
9 | 631888738373188 |
10 | 145451144020130 |
11 | 42388535994433 |
12 | 143914a5a08482 |
13 | 6320ca3ba6cb0 |
14 | 27cbc31483a14 |
15 | 11c37b862a355 |
hex | 84497bc580a2 |
145451144020130 has 32 divisors (see below), whose sum is σ = 281979620722800. Its totient is φ = 53699671636992.
The previous prime is 145451144020123. The next prime is 145451144020151. The reversal of 145451144020130 is 31020441154541.
It can be written as a sum of positive squares in 8 ways, for example, as 64590170313601 + 80860973706529 = 8036801^2 + 8992273^2 .
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54591275 + ... + 57193614.
Almost surely, 2145451144020130 is an apocalyptic number.
145451144020130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145451144020130 is a deficient number, since it is larger than the sum of its proper divisors (136528476702670).
145451144020130 is a wasteful number, since it uses less digits than its factorization.
145451144020130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111794918.
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 145451144020130 its reverse (31020441154541), we get a palindrome (176471585174671).
The spelling of 145451144020130 in words is "one hundred forty-five trillion, four hundred fifty-one billion, one hundred forty-four million, twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.892 sec. • engine limits •