Base | Representation |
---|---|
bin | 100000000011110101000110… |
… | …101000011000010010110111 |
3 | 200111020112100212112002111120 |
4 | 200003311012220120102313 |
5 | 121440123331041211100 |
6 | 1215514451211435023 |
7 | 41461650645651540 |
oct | 4003650650302267 |
9 | 614215325462446 |
10 | 141000666350775 |
11 | 40a22057303360 |
12 | 13992a59a55a73 |
13 | 608a3c8a6662a |
14 | 26b667c02d4c7 |
15 | 1147b3e4ca0a0 |
hex | 803d46a184b7 |
141000666350775 has 48 divisors (see below), whose sum is σ = 290644490443008. Its totient is φ = 58597679520000.
The previous prime is 141000666350701. The next prime is 141000666350893. The reversal of 141000666350775 is 577053666000141.
It is not a de Polignac number, because 141000666350775 - 27 = 141000666350647 is a prime.
It is a super-2 number, since 2×1410006663507752 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12207844126 + ... + 12207855675.
It is an arithmetic number, because the mean of its divisors is an integer number (6055093550896).
Almost surely, 2141000666350775 is an apocalyptic number.
141000666350775 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
141000666350775 is an abundant number, since it is smaller than the sum of its proper divisors (149643824092233).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141000666350775 is a wasteful number, since it uses less digits than its factorization.
141000666350775 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24415699832 (or 24415699827 counting only the distinct ones).
The product of its (nonzero) digits is 3175200, while the sum is 51.
The spelling of 141000666350775 in words is "one hundred forty-one trillion, six hundred sixty-six million, three hundred fifty thousand, seven hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •