Base | Representation |
---|---|
bin | 100000000011110100110111… |
… | …000000011010000011111011 |
3 | 200111020111200121021011110112 |
4 | 200003310313000122003323 |
5 | 121440122311434322021 |
6 | 1215514405205134535 |
7 | 41461641313560446 |
oct | 4003646700320373 |
9 | 614214617234415 |
10 | 141000404214011 |
11 | 40a21a32340101 |
12 | 139929a60ba44b |
13 | 608a386664914 |
14 | 26b66552b465d |
15 | 1147b26499d5b |
hex | 803d3701a0fb |
141000404214011 has 8 divisors (see below), whose sum is σ = 141048850731744. Its totient is φ = 140951962166400.
The previous prime is 141000404213953. The next prime is 141000404214031. The reversal of 141000404214011 is 110412404000141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141000404214011 - 218 = 141000403951867 is a prime.
It is a super-2 number, since 2×1410004042140112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141000404214031) 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, 62602211 + ... + 64815411.
It is an arithmetic number, because the mean of its divisors is an integer number (17631106341468).
Almost surely, 2141000404214011 is an apocalyptic number.
141000404214011 is a deficient number, since it is larger than the sum of its proper divisors (48446517733).
141000404214011 is a wasteful number, since it uses less digits than its factorization.
141000404214011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2235061.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 141000404214011 its reverse (110412404000141), we get a palindrome (251412808214152).
The spelling of 141000404214011 in words is "one hundred forty-one trillion, four hundred four million, two hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •