Base | Representation |
---|---|
bin | 10000110110010… |
… | …01101011010101 |
3 | 100211221120112000 |
4 | 20123021223111 |
5 | 242140212003 |
6 | 22005145513 |
7 | 3334221063 |
oct | 1033115325 |
9 | 324846460 |
10 | 141335253 |
11 | 728642a4 |
12 | 3b3bb299 |
13 | 23387037 |
14 | 14ab1033 |
15 | c61c1a3 |
hex | 86c9ad5 |
141335253 has 16 divisors (see below), whose sum is σ = 218490240. Its totient is φ = 90126432.
The previous prime is 141335219. The next prime is 141335269. The reversal of 141335253 is 352533141.
141335253 is a `hidden beast` number, since 1 + 4 + 133 + 525 + 3 = 666.
141335253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 141335253 - 26 = 141335189 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141335213) 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, 113176 + ... + 114417.
It is an arithmetic number, because the mean of its divisors is an integer number (13655640).
Almost surely, 2141335253 is an apocalyptic number.
It is an amenable number.
141335253 is a deficient number, since it is larger than the sum of its proper divisors (77154987).
141335253 is a wasteful number, since it uses less digits than its factorization.
141335253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227625 (or 227619 counting only the distinct ones).
The product of its digits is 5400, while the sum is 27.
The square root of 141335253 is about 11888.4504036481. The cubic root of 141335253 is about 520.8949738132.
Adding to 141335253 its reverse (352533141), we get a palindrome (493868394).
The spelling of 141335253 in words is "one hundred forty-one million, three hundred thirty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •