Base | Representation |
---|---|
bin | 111100110011110… |
… | …0111111011111011 |
3 | 12021012102121012202 |
4 | 1321213213323323 |
5 | 13134322232311 |
6 | 534245300415 |
7 | 101364241322 |
oct | 17147477373 |
9 | 5235377182 |
10 | 2040430331 |
11 | 957851565 |
12 | 48b40470b |
13 | 266961a34 |
14 | 154dc10b9 |
15 | be1ebe3b |
hex | 799e7efb |
2040430331 has 4 divisors (see below), whose sum is σ = 2045570352. Its totient is φ = 2035290312.
The previous prime is 2040430307. The next prime is 2040430361. The reversal of 2040430331 is 1330340402.
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 2040430331 - 26 = 2040430267 is a prime.
It is a super-2 number, since 2×20404303312 = 8326711871329539122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2040430361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2569415 + ... + 2570208.
It is an arithmetic number, because the mean of its divisors is an integer number (511392588).
Almost surely, 22040430331 is an apocalyptic number.
2040430331 is a deficient number, since it is larger than the sum of its proper divisors (5140021).
2040430331 is an equidigital number, since it uses as much as digits as its factorization.
2040430331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5140020.
The product of its (nonzero) digits is 864, while the sum is 20.
The square root of 2040430331 is about 45171.1227555836. The cubic root of 2040430331 is about 1268.3543135336.
Adding to 2040430331 its reverse (1330340402), we get a palindrome (3370770733).
The spelling of 2040430331 in words is "two billion, forty million, four hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •