Base | Representation |
---|---|
bin | 100000000011111111111001… |
… | …010111111111111100110101 |
3 | 200111021122021111211012200210 |
4 | 200003333321113333330311 |
5 | 121440321044302104023 |
6 | 1215524045151100033 |
7 | 41462541064550424 |
oct | 4003777127777465 |
9 | 614248244735623 |
10 | 141012255113013 |
11 | 40a26a63913a09 |
12 | 13995152b11619 |
13 | 608b5249537ab |
14 | 26b705b19d2bb |
15 | 11480bbab7593 |
hex | 803ff95fff35 |
141012255113013 has 48 divisors (see below), whose sum is σ = 200710170965952. Its totient is φ = 88040977920000.
The previous prime is 141012255112973. The next prime is 141012255113017. The reversal of 141012255113013 is 310311552210141.
It is not a de Polignac number, because 141012255113013 - 213 = 141012255104821 is a prime.
It is a super-2 number, since 2×1410122551130132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141012255113017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 69108918 + ... + 71120088.
It is an arithmetic number, because the mean of its divisors is an integer number (4181461895124).
Almost surely, 2141012255113013 is an apocalyptic number.
It is an amenable number.
141012255113013 is a deficient number, since it is larger than the sum of its proper divisors (59697915852939).
141012255113013 is a wasteful number, since it uses less digits than its factorization.
141012255113013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011954 (or 2011935 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 30.
The spelling of 141012255113013 in words is "one hundred forty-one trillion, twelve billion, two hundred fifty-five million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •