Base | Representation |
---|---|
bin | 11111110111010011101010… |
… | …001000100010100010010001 |
3 | 200101012021010222200221102220 |
4 | 133313103222020202202101 |
5 | 121332023431441303131 |
6 | 1214015252143131253 |
7 | 41342534561343522 |
oct | 3767235210424221 |
9 | 611167128627386 |
10 | 140140121041041 |
11 | 40720100978300 |
12 | 13874116ba3b29 |
13 | 60272063a23c4 |
14 | 2686b64a26849 |
15 | 1130575b6be96 |
hex | 7f74ea222891 |
140140121041041 has 48 divisors (see below), whose sum is σ = 206151395346624. Its totient is φ = 84616342272000.
The previous prime is 140140121041033. The next prime is 140140121041061.
140140121041041 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 140140121041041 - 23 = 140140121041033 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140140121041031) 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 47 ways as a sum of consecutive naturals, for example, 597314286 + ... + 597548856.
It is an arithmetic number, because the mean of its divisors is an integer number (4294820736388).
Almost surely, 2140140121041041 is an apocalyptic number.
140140121041041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140140121041041 is a deficient number, since it is larger than the sum of its proper divisors (66011274305583).
140140121041041 is a wasteful number, since it uses less digits than its factorization.
140140121041041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240734 (or 240723 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 24.
The spelling of 140140121041041 in words is "one hundred forty trillion, one hundred forty billion, one hundred twenty-one million, forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •