Base | Representation |
---|---|
bin | 1011010100110111… |
… | …1110110110110111 |
3 | 21211212221100101012 |
4 | 2311031332312313 |
5 | 22211311411211 |
6 | 1221405022435 |
7 | 135225322121 |
oct | 26515766667 |
9 | 7755840335 |
10 | 3040341431 |
11 | 1320214576 |
12 | 70a254a1b |
13 | 395b6a5ca |
14 | 20bb08211 |
15 | 12bdb1d8b |
hex | b537edb7 |
3040341431 has 4 divisors (see below), whose sum is σ = 3040695000. Its totient is φ = 3039987864.
The previous prime is 3040341427. The next prime is 3040341433. The reversal of 3040341431 is 1341430403.
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 3040341431 - 22 = 3040341427 is a prime.
It is a super-2 number, since 2×30403414312 = 18487352034110255522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3040341397 and 3040341406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3040341433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 163556 + ... + 181193.
It is an arithmetic number, because the mean of its divisors is an integer number (760173750).
Almost surely, 23040341431 is an apocalyptic number.
3040341431 is a deficient number, since it is larger than the sum of its proper divisors (353569).
3040341431 is an equidigital number, since it uses as much as digits as its factorization.
3040341431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 353568.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 3040341431 is about 55139.2911724480. The cubic root of 3040341431 is about 1448.6855199508.
Adding to 3040341431 its reverse (1341430403), we get a palindrome (4381771834).
The spelling of 3040341431 in words is "three billion, forty million, three hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •