Base | Representation |
---|---|
bin | 100001000001010100010010… |
… | …101101100101111000110011 |
3 | 201001012110210122100222121100 |
4 | 201001110102231211320303 |
5 | 123013340414014334303 |
6 | 1232511531224055443 |
7 | 42406143505625262 |
oct | 4101242255457063 |
9 | 631173718328540 |
10 | 145226043121203 |
11 | 42301023341370 |
12 | 14355944004583 |
13 | 63059ac484905 |
14 | 27c0d998725d9 |
15 | 11bc9e17028a3 |
hex | 841512b65e33 |
145226043121203 has 48 divisors (see below), whose sum is σ = 231069536964864. Its totient is φ = 87158718463680.
The previous prime is 145226043121129. The next prime is 145226043121213. The reversal of 145226043121203 is 302121340622541.
It is a happy number.
145226043121203 is a `hidden beast` number, since 1 + 4 + 5 + 2 + 2 + 6 + 0 + 431 + 212 + 0 + 3 = 666.
It is not a de Polignac number, because 145226043121203 - 28 = 145226043120947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (145226043121213) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 384166600 + ... + 384544442.
It is an arithmetic number, because the mean of its divisors is an integer number (4813948686768).
Almost surely, 2145226043121203 is an apocalyptic number.
145226043121203 is a deficient number, since it is larger than the sum of its proper divisors (85843493843661).
145226043121203 is a wasteful number, since it uses less digits than its factorization.
145226043121203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415656 (or 415653 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
Adding to 145226043121203 its reverse (302121340622541), we get a palindrome (447347383743744).
The spelling of 145226043121203 in words is "one hundred forty-five trillion, two hundred twenty-six billion, forty-three million, one hundred twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •