Base | Representation |
---|---|
bin | 100000000100010011100001… |
… | …000011111001001001000110 |
3 | 200111100122122200221020210101 |
4 | 200010103201003321021012 |
5 | 121441142220414304132 |
6 | 1215541451432114314 |
7 | 41464215123422452 |
oct | 4004234103711106 |
9 | 614318580836711 |
10 | 141033322025542 |
11 | 40a34994609121 |
12 | 1399925223599a |
13 | 60905013959cb |
14 | 26b809904d662 |
15 | 11489013307e7 |
hex | 8044e10f9246 |
141033322025542 has 8 divisors (see below), whose sum is σ = 211818788609976. Its totient is φ = 70427059155552.
The previous prime is 141033322025507. The next prime is 141033322025579. The reversal of 141033322025542 is 245520223330141.
141033322025542 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44800926643 + ... + 44800929790.
It is an arithmetic number, because the mean of its divisors is an integer number (26477348576247).
Almost surely, 2141033322025542 is an apocalyptic number.
141033322025542 is a deficient number, since it is larger than the sum of its proper divisors (70785466584434).
141033322025542 is an equidigital number, since it uses as much as digits as its factorization.
141033322025542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89601857222.
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 141033322025542 its reverse (245520223330141), we get a palindrome (386553545355683).
The spelling of 141033322025542 in words is "one hundred forty-one trillion, thirty-three billion, three hundred twenty-two million, twenty-five thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •