Base | Representation |
---|---|
bin | 1000010000010010100… |
… | …1110001110011011011 |
3 | 111120001010021002010021 |
4 | 2010010221301303123 |
5 | 4310412331402111 |
6 | 145051510531311 |
7 | 13150142645203 |
oct | 2040451616333 |
9 | 446033232107 |
10 | 141811981531 |
11 | 55162191740 |
12 | 23598666b37 |
13 | 104b00b880c |
14 | 6c14143403 |
15 | 3a4ed44d71 |
hex | 2104a71cdb |
141811981531 has 4 divisors (see below), whose sum is σ = 154703979864. Its totient is φ = 128919983200.
The previous prime is 141811981517. The next prime is 141811981559. The reversal of 141811981531 is 135189118141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 141811981531 - 25 = 141811981499 is a prime.
It is a super-2 number, since 2×1418119815312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141811981231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6445999150 + ... + 6445999171.
It is an arithmetic number, because the mean of its divisors is an integer number (38675994966).
Almost surely, 2141811981531 is an apocalyptic number.
141811981531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
141811981531 is a deficient number, since it is larger than the sum of its proper divisors (12891998333).
141811981531 is a wasteful number, since it uses less digits than its factorization.
141811981531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12891998332.
The product of its digits is 34560, while the sum is 43.
The spelling of 141811981531 in words is "one hundred forty-one billion, eight hundred eleven million, nine hundred eighty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •