Base | Representation |
---|---|
bin | 1000011100100110000… |
… | …1110110010010111110 |
3 | 111212120022111112022112 |
4 | 2013021201312102332 |
5 | 4334143420424314 |
6 | 150355342214022 |
7 | 13325041161353 |
oct | 2071141662276 |
9 | 455508445275 |
10 | 145115014334 |
11 | 565a7708114 |
12 | 2415a884312 |
13 | 108b84c03b4 |
14 | 7048aac62a |
15 | 3b94ce643e |
hex | 21c98764be |
145115014334 has 4 divisors (see below), whose sum is σ = 217672521504. Its totient is φ = 72557507166.
The previous prime is 145115014333. The next prime is 145115014337. The reversal of 145115014334 is 433410511541.
145115014334 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a self number, because there is not a number n which added to its sum of digits gives 145115014334.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145115014333) by changing a digit.
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 as a sum of consecutive naturals, namely, 36278753582 + ... + 36278753585.
It is an arithmetic number, because the mean of its divisors is an integer number (54418130376).
Almost surely, 2145115014334 is an apocalyptic number.
145115014334 is a deficient number, since it is larger than the sum of its proper divisors (72557507170).
145115014334 is an equidigital number, since it uses as much as digits as its factorization.
145115014334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72557507169.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 145115014334 its reverse (433410511541), we get a palindrome (578525525875).
The spelling of 145115014334 in words is "one hundred forty-five billion, one hundred fifteen million, fourteen thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •