Base | Representation |
---|---|
bin | 100000000011110101100111… |
… | …001110001011010100011011 |
3 | 200111020120202222101100121101 |
4 | 200003311213032023110123 |
5 | 121440130441030130021 |
6 | 1215515021343052231 |
7 | 41462000335340233 |
oct | 4003654716132433 |
9 | 614216688340541 |
10 | 141001213130011 |
11 | 40a22307a10723 |
12 | 13992b90ba1077 |
13 | 608a485119b40 |
14 | 26b66d08c0cc3 |
15 | 1147b724d3a91 |
hex | 803d6738b51b |
141001213130011 has 8 divisors (see below), whose sum is σ = 151977133632464. Its totient is φ = 130043817390240.
The previous prime is 141001213129991. The next prime is 141001213130077. The reversal of 141001213130011 is 110031312100141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 141001213130011 - 27 = 141001213129883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141001213130111) 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 7 ways as a sum of consecutive naturals, for example, 4631174856 + ... + 4631205301.
It is an arithmetic number, because the mean of its divisors is an integer number (18997141704058).
Almost surely, 2141001213130011 is an apocalyptic number.
141001213130011 is a deficient number, since it is larger than the sum of its proper divisors (10975920502453).
141001213130011 is a wasteful number, since it uses less digits than its factorization.
141001213130011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9262381341.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 141001213130011 its reverse (110031312100141), we get a palindrome (251032525230152).
The spelling of 141001213130011 in words is "one hundred forty-one trillion, one billion, two hundred thirteen million, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •