Base | Representation |
---|---|
bin | 111100110010111… |
… | …1110111010000011 |
3 | 12021011121202002102 |
4 | 1321211332322003 |
5 | 13134220001011 |
6 | 534232141015 |
7 | 101360500151 |
oct | 17145767203 |
9 | 5234552072 |
10 | 2040000131 |
11 | 957588324 |
12 | 48b23776b |
13 | 266840c90 |
14 | 154d0c3d1 |
15 | be16473b |
hex | 7997ee83 |
2040000131 has 8 divisors (see below), whose sum is σ = 2197305264. Its totient is φ = 1882749600.
The previous prime is 2040000101. The next prime is 2040000133. The reversal of 2040000131 is 1310000402.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2040000131 - 226 = 1972891267 is a prime.
It is a super-2 number, since 2×20400001312 = 8323201068960034322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2040000133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97556 + ... + 116606.
It is an arithmetic number, because the mean of its divisors is an integer number (274663158).
Almost surely, 22040000131 is an apocalyptic number.
2040000131 is a deficient number, since it is larger than the sum of its proper divisors (157305133).
2040000131 is a wasteful number, since it uses less digits than its factorization.
2040000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27301.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 2040000131 is about 45166.3606127392. The cubic root of 2040000131 is about 1268.2651682245.
Adding to 2040000131 its reverse (1310000402), we get a palindrome (3350000533).
The spelling of 2040000131 in words is "two billion, forty million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •