Base | Representation |
---|---|
bin | 1000011101000110011… |
… | …0000110010101100111 |
3 | 111212220202011002221011 |
4 | 2013101212012111213 |
5 | 4334433042040333 |
6 | 150421015003051 |
7 | 13331303400334 |
oct | 2072146062547 |
9 | 455822132834 |
10 | 145250346343 |
11 | 56667041053 |
12 | 24198069487 |
13 | 1090a554acb |
14 | 705ca5998b |
15 | 3ba1b299cd |
hex | 21d1986567 |
145250346343 has 8 divisors (see below), whose sum is σ = 147801139200. Its totient is φ = 142702517688.
The previous prime is 145250346301. The next prime is 145250346401. The reversal of 145250346343 is 343643052541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145250346343 - 29 = 145250345831 is a prime.
It is a super-2 number, since 2×1452503463432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145250346296 and 145250346305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145250346743) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 642073 + ... + 838306.
It is an arithmetic number, because the mean of its divisors is an integer number (18475142400).
Almost surely, 2145250346343 is an apocalyptic number.
145250346343 is a deficient number, since it is larger than the sum of its proper divisors (2550792857).
145250346343 is a wasteful number, since it uses less digits than its factorization.
145250346343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1482101.
The product of its (nonzero) digits is 518400, while the sum is 40.
Adding to 145250346343 its reverse (343643052541), we get a palindrome (488893398884).
The spelling of 145250346343 in words is "one hundred forty-five billion, two hundred fifty million, three hundred forty-six thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •