Base | Representation |
---|---|
bin | 1000011100010111001… |
… | …0001111000111011010 |
3 | 111212101221022022012211 |
4 | 2013011302033013122 |
5 | 4334031330421214 |
6 | 150345220025334 |
7 | 13323346240360 |
oct | 2070562170732 |
9 | 455357268184 |
10 | 145052201434 |
11 | 56575205928 |
12 | 2414183224a |
13 | 108a8499cba |
14 | 70405db630 |
15 | 3b8e53a0c4 |
hex | 21c5c8f1da |
145052201434 has 32 divisors (see below), whose sum is σ = 252424016640. Its totient is φ = 61226865792.
The previous prime is 145052201423. The next prime is 145052201443. The reversal of 145052201434 is 434102250541.
145052201434 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1450522014342 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145052201396 and 145052201405.
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, 624507 + ... + 824689.
It is an arithmetic number, because the mean of its divisors is an integer number (7888250520).
Almost surely, 2145052201434 is an apocalyptic number.
145052201434 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
145052201434 is a deficient number, since it is larger than the sum of its proper divisors (107371815206).
145052201434 is a wasteful number, since it uses less digits than its factorization.
145052201434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200974.
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 145052201434 its reverse (434102250541), we get a palindrome (579154451975).
The spelling of 145052201434 in words is "one hundred forty-five billion, fifty-two million, two hundred one thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •