Base | Representation |
---|---|
bin | 100001000001011000001011… |
… | …010001010001001111111110 |
3 | 201001012212120021011010102200 |
4 | 201001120023101101033332 |
5 | 123013422434041122142 |
6 | 1232513501111532330 |
7 | 42406352033124555 |
oct | 4101301321211776 |
9 | 631185507133380 |
10 | 145230213223422 |
11 | 42302873247938 |
12 | 1435670868a0a6 |
13 | 63061c53c3012 |
14 | 27c1273624d9c |
15 | 11bcb8787864c |
hex | 84160b4513fe |
145230213223422 has 24 divisors (see below), whose sum is σ = 314678030978376. Its totient is φ = 48408137383056.
The previous prime is 145230213223421. The next prime is 145230213223457. The reversal of 145230213223422 is 224322312032541.
145230213223422 is a `hidden beast` number, since 1 + 4 + 5 + 2 + 3 + 0 + 2 + 1 + 3 + 223 + 422 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145230213223421) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 160677768 + ... + 161579099.
It is an arithmetic number, because the mean of its divisors is an integer number (13111584624099).
Almost surely, 2145230213223422 is an apocalyptic number.
145230213223422 is an abundant number, since it is smaller than the sum of its proper divisors (169447817754954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145230213223422 is a wasteful number, since it uses less digits than its factorization.
145230213223422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322281912 (or 322281909 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 36.
Adding to 145230213223422 its reverse (224322312032541), we get a palindrome (369552525255963).
The spelling of 145230213223422 in words is "one hundred forty-five trillion, two hundred thirty billion, two hundred thirteen million, two hundred twenty-three thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •