Base | Representation |
---|---|
bin | 100000000100011010000010… |
… | …110110100100111100110100 |
3 | 200111101022202012022221100112 |
4 | 200010122002312210330310 |
5 | 121441301044320130002 |
6 | 1215545011143402152 |
7 | 41464553615262350 |
oct | 4004320266447464 |
9 | 614338665287315 |
10 | 141040331411252 |
11 | 40a37961193379 |
12 | 1399a689753358 |
13 | 609107a606a10 |
14 | 26b8561d30460 |
15 | 1148bb18a0852 |
hex | 804682da4f34 |
141040331411252 has 48 divisors (see below), whose sum is σ = 304097937034752. Its totient is φ = 55737626999040.
The previous prime is 141040331411233. The next prime is 141040331411257. The reversal of 141040331411252 is 252114133040141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141040331411257) 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 15 ways as a sum of consecutive naturals, for example, 202944524 + ... + 203638307.
It is an arithmetic number, because the mean of its divisors is an integer number (6335373688224).
Almost surely, 2141040331411252 is an apocalyptic number.
It is an amenable number.
141040331411252 is an abundant number, since it is smaller than the sum of its proper divisors (163057605623500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141040331411252 is a wasteful number, since it uses less digits than its factorization.
141040331411252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406583808 (or 406583806 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 141040331411252 its reverse (252114133040141), we get a palindrome (393154464451393).
The spelling of 141040331411252 in words is "one hundred forty-one trillion, forty billion, three hundred thirty-one million, four hundred eleven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •