Base | Representation |
---|---|
bin | 11111110101011101011111… |
… | …101000110000101101111011 |
3 | 200100202010122200001010101110 |
4 | 133311131133220300231323 |
5 | 121322434110302400011 |
6 | 1213441110203051403 |
7 | 41330423460251610 |
oct | 3765353750605573 |
9 | 610663580033343 |
10 | 140013243403131 |
11 | 4068131284400a |
12 | 13853607b10b63 |
13 | 6018266355207 |
14 | 268096a0d6507 |
15 | 112c0ebebcba6 |
hex | 7f575fa30b7b |
140013243403131 has 64 divisors (see below), whose sum is σ = 225763776000000. Its totient is φ = 75399048692352.
The previous prime is 140013243403127. The next prime is 140013243403139. The reversal of 140013243403131 is 131304342310041.
It is not a de Polignac number, because 140013243403131 - 22 = 140013243403127 is a prime.
It is a super-2 number, since 2×1400132434031312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140013243403139) 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 63 ways as a sum of consecutive naturals, for example, 57146320 + ... + 59546018.
It is an arithmetic number, because the mean of its divisors is an integer number (3527559000000).
Almost surely, 2140013243403131 is an apocalyptic number.
140013243403131 is a deficient number, since it is larger than the sum of its proper divisors (85750532596869).
140013243403131 is a wasteful number, since it uses less digits than its factorization.
140013243403131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2400496.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 140013243403131 its reverse (131304342310041), we get a palindrome (271317585713172).
The spelling of 140013243403131 in words is "one hundred forty trillion, thirteen billion, two hundred forty-three million, four hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •