Base | Representation |
---|---|
bin | 10000110110100… |
… | …00110100110011 |
3 | 100212000001200101 |
4 | 20123100310303 |
5 | 242142131111 |
6 | 22005533231 |
7 | 3334402330 |
oct | 1033206463 |
9 | 325001611 |
10 | 141364531 |
11 | 728842a0 |
12 | 3b414217 |
13 | 23397469 |
14 | 14abb987 |
15 | c625bc1 |
hex | 86d0d33 |
141364531 has 48 divisors (see below), whose sum is σ = 190644480. Its totient is φ = 101727360.
The previous prime is 141364471. The next prime is 141364547. The reversal of 141364531 is 135463141.
It is not a de Polignac number, because 141364531 - 27 = 141364403 is a prime.
It is a super-2 number, since 2×1413645312 = 39967861249699922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 141364531.
It is not an unprimeable number, because it can be changed into a prime (141364591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2395980 + ... + 2396038.
It is an arithmetic number, because the mean of its divisors is an integer number (3971760).
Almost surely, 2141364531 is an apocalyptic number.
141364531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
141364531 is a deficient number, since it is larger than the sum of its proper divisors (49279949).
141364531 is a wasteful number, since it uses less digits than its factorization.
141364531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172 (or 143 counting only the distinct ones).
The product of its digits is 4320, while the sum is 28.
The square root of 141364531 is about 11889.6817030566. The cubic root of 141364531 is about 520.9309396221.
The spelling of 141364531 in words is "one hundred forty-one million, three hundred sixty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •