Base | Representation |
---|---|
bin | 100000001000111011100100… |
… | …010101011001010001100001 |
3 | 200112111001011110221101022220 |
4 | 200020323210111121101201 |
5 | 122011344231324301103 |
6 | 1220343502533221253 |
7 | 41526200422166400 |
oct | 4010734425312141 |
9 | 615431143841286 |
10 | 141351204525153 |
11 | 41047788a33017 |
12 | 13a2a988491829 |
13 | 60b4490c9491c |
14 | 26c9613153637 |
15 | 1151d088d7c53 |
hex | 808ee4559461 |
141351204525153 has 12 divisors (see below), whose sum is σ = 219238602937200. Its totient is φ = 80772116871432.
The previous prime is 141351204525127. The next prime is 141351204525169. The reversal of 141351204525153 is 351525402153141.
It is not a de Polignac number, because 141351204525153 - 224 = 141351187747937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141351204525253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 480786409803 + ... + 480786410096.
It is an arithmetic number, because the mean of its divisors is an integer number (18269883578100).
Almost surely, 2141351204525153 is an apocalyptic number.
It is an amenable number.
141351204525153 is a deficient number, since it is larger than the sum of its proper divisors (77887398412047).
141351204525153 is an equidigital number, since it uses as much as digits as its factorization.
141351204525153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 961572819916 (or 961572819909 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 42.
Adding to 141351204525153 its reverse (351525402153141), we get a palindrome (492876606678294).
The spelling of 141351204525153 in words is "one hundred forty-one trillion, three hundred fifty-one billion, two hundred four million, five hundred twenty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •