Base | Representation |
---|---|
bin | 111100111000101… |
… | …1011010101000011 |
3 | 12021101021011022112 |
4 | 1321301123111003 |
5 | 13141002001011 |
6 | 534420325535 |
7 | 101425133414 |
oct | 17161332503 |
9 | 5241234275 |
10 | 2043000131 |
11 | 959247267 |
12 | 4902438ab |
13 | 267351623 |
14 | 15548d80b |
15 | be55858b |
hex | 79c5b543 |
2043000131 has 8 divisors (see below), whose sum is σ = 2048254320. Its totient is φ = 2037754368.
The previous prime is 2043000121. The next prime is 2043000163. The reversal of 2043000131 is 1310003402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2043000131 is a prime.
It is a super-2 number, since 2×20430001312 = 8347699070532034322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2043000121) 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 7 ways as a sum of consecutive naturals, for example, 869300 + ... + 871646.
It is an arithmetic number, because the mean of its divisors is an integer number (256031790).
Almost surely, 22043000131 is an apocalyptic number.
2043000131 is a deficient number, since it is larger than the sum of its proper divisors (5254189).
2043000131 is an equidigital number, since it uses as much as digits as its factorization.
2043000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4213.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2043000131 is about 45199.5589690873. The cubic root of 2043000131 is about 1268.8865622910.
Adding to 2043000131 its reverse (1310003402), we get a palindrome (3353003533).
The spelling of 2043000131 in words is "two billion, forty-three million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •