Base | Representation |
---|---|
bin | 100000000100011010000010… |
… | …110110100011000001010111 |
3 | 200111101022202012022112111220 |
4 | 200010122002312203001113 |
5 | 121441301044314401401 |
6 | 1215545011143301423 |
7 | 41464553615230332 |
oct | 4004320266430127 |
9 | 614338665275456 |
10 | 141040331403351 |
11 | 40a37961188446 |
12 | 1399a68974a873 |
13 | 609107a603243 |
14 | 26b8561d2b619 |
15 | 1148bb189d336 |
hex | 804682da3057 |
141040331403351 has 8 divisors (see below), whose sum is σ = 188053975591680. Its totient is φ = 94026787408632.
The previous prime is 141040331403329. The next prime is 141040331403383. The reversal of 141040331403351 is 153304133040141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 141040331403351 - 25 = 141040331403319 is a prime.
It is a super-2 number, since 2×1410403314033512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141040332403351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21699871 + ... + 27440208.
It is an arithmetic number, because the mean of its divisors is an integer number (23506746948960).
Almost surely, 2141040331403351 is an apocalyptic number.
141040331403351 is a deficient number, since it is larger than the sum of its proper divisors (47013644188329).
141040331403351 is an equidigital number, since it uses as much as digits as its factorization.
141040331403351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50096805.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 141040331403351 its reverse (153304133040141), we get a palindrome (294344464443492).
The spelling of 141040331403351 in words is "one hundred forty-one trillion, forty billion, three hundred thirty-one million, four hundred three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •