Base | Representation |
---|---|
bin | 1000011101110110110… |
… | …0010110100101010111 |
3 | 111220102220001211221102 |
4 | 2013131230112211113 |
5 | 4340342021443333 |
6 | 150453105140315 |
7 | 13336316520053 |
oct | 2073554264527 |
9 | 456386054842 |
10 | 145453312343 |
11 | 5676066a449 |
12 | 2423402a69b |
13 | 1094060a131 |
14 | 707b9b0c63 |
15 | 3bb486cae8 |
hex | 21ddb16957 |
145453312343 has 8 divisors (see below), whose sum is σ = 146920176000. Its totient is φ = 143987500728.
The previous prime is 145453312331. The next prime is 145453312363. The reversal of 145453312343 is 343213354541.
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 145453312343 - 24 = 145453312327 is a prime.
It is a super-2 number, since 2×1454533123432 (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 = 145453312297 and 145453312306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145453312363) 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, 16388 + ... + 539606.
It is an arithmetic number, because the mean of its divisors is an integer number (18365022000).
Almost surely, 2145453312343 is an apocalyptic number.
145453312343 is a deficient number, since it is larger than the sum of its proper divisors (1466863657).
145453312343 is a wasteful number, since it uses less digits than its factorization.
145453312343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526021.
The product of its digits is 259200, while the sum is 38.
Adding to 145453312343 its reverse (343213354541), we get a palindrome (488666666884).
The spelling of 145453312343 in words is "one hundred forty-five billion, four hundred fifty-three million, three hundred twelve thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •