Base | Representation |
---|---|
bin | 100001000001101011101001… |
… | …011110100100011110110011 |
3 | 201001021212112101001101022011 |
4 | 201001223221132210132303 |
5 | 123014243244001334303 |
6 | 1232531235512423351 |
7 | 42411022121253016 |
oct | 4101535136443663 |
9 | 631255471041264 |
10 | 145251121121203 |
11 | 423107222029a9 |
12 | 1435a7826a7b57 |
13 | 6308177bcb076 |
14 | 27c229832137d |
15 | 11bd4ad18116d |
hex | 841ae97a47b3 |
145251121121203 has 16 divisors (see below), whose sum is σ = 151049072079360. Its totient is φ = 139505814806400.
The previous prime is 145251121121201. The next prime is 145251121121257. The reversal of 145251121121203 is 302121121152541.
It is a happy number.
145251121121203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 145251121121203 - 21 = 145251121121201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145251121121201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 381009001 + ... + 381390037.
It is an arithmetic number, because the mean of its divisors is an integer number (9440567004960).
Almost surely, 2145251121121203 is an apocalyptic number.
145251121121203 is a deficient number, since it is larger than the sum of its proper divisors (5797950958157).
145251121121203 is a wasteful number, since it uses less digits than its factorization.
145251121121203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 450078.
The product of its (nonzero) digits is 4800, while the sum is 31.
Adding to 145251121121203 its reverse (302121121152541), we get a palindrome (447372242273744).
The spelling of 145251121121203 in words is "one hundred forty-five trillion, two hundred fifty-one billion, one hundred twenty-one million, one hundred twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •