Base | Representation |
---|---|
bin | 100000000011111111000011… |
… | …100111100011100110001001 |
3 | 200111021112221122202101010220 |
4 | 200003333003213203212021 |
5 | 121440312222411042023 |
6 | 1215523415452300253 |
7 | 41462506533603225 |
oct | 4003770347434611 |
9 | 614245848671126 |
10 | 141011353221513 |
11 | 40a2664080a535 |
12 | 13994b40a71689 |
13 | 608b40cb47198 |
14 | 26b6db34ad785 |
15 | 11480678153e3 |
hex | 803fc39e3989 |
141011353221513 has 16 divisors (see below), whose sum is σ = 190398229236480. Its totient is φ = 92816062425216.
The previous prime is 141011353221509. The next prime is 141011353221527. The reversal of 141011353221513 is 315122353110141.
It is not a de Polignac number, because 141011353221513 - 22 = 141011353221509 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141011353221913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9502981 + ... + 19295837.
It is an arithmetic number, because the mean of its divisors is an integer number (11899889327280).
Almost surely, 2141011353221513 is an apocalyptic number.
It is an amenable number.
141011353221513 is a deficient number, since it is larger than the sum of its proper divisors (49386876014967).
141011353221513 is an equidigital number, since it uses as much as digits as its factorization.
141011353221513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9853696.
The product of its (nonzero) digits is 10800, while the sum is 33.
The spelling of 141011353221513 in words is "one hundred forty-one trillion, eleven billion, three hundred fifty-three million, two hundred twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •