Base | Representation |
---|---|
bin | 1000011100100101001… |
… | …0100110000000001010 |
3 | 111212120000222100212010 |
4 | 2013021102212000022 |
5 | 4334141404443214 |
6 | 150355120400350 |
7 | 13324662164640 |
oct | 2071122460012 |
9 | 455500870763 |
10 | 145111015434 |
11 | 565a5426740 |
12 | 241594760b6 |
13 | 108b7720198 |
14 | 704834b190 |
15 | 3b947a6659 |
hex | 21c94a600a |
145111015434 has 32 divisors (see below), whose sum is σ = 361835260416. Its totient is φ = 37691172720.
The previous prime is 145111015433. The next prime is 145111015459. The reversal of 145111015434 is 434510111541.
145111015434 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (145111015433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157046092 + ... + 157047015.
It is an arithmetic number, because the mean of its divisors is an integer number (11307351888).
Almost surely, 2145111015434 is an apocalyptic number.
145111015434 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
145111015434 is an abundant number, since it is smaller than the sum of its proper divisors (216724244982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145111015434 is a wasteful number, since it uses less digits than its factorization.
145111015434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314093130.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 145111015434 its reverse (434510111541), we get a palindrome (579621126975).
The spelling of 145111015434 in words is "one hundred forty-five billion, one hundred eleven million, fifteen thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •