Base | Representation |
---|---|
bin | 1100101010111100… |
… | …0011001011010011 |
3 | 22210001012112112110 |
4 | 3022233003023103 |
5 | 23431220101121 |
6 | 1321302200403 |
7 | 150200561052 |
oct | 31257031323 |
9 | 8701175473 |
10 | 3401331411 |
11 | 1495a656a5 |
12 | 7ab123103 |
13 | 4228a0b4a |
14 | 243a36399 |
15 | 14d91bd76 |
hex | cabc32d3 |
3401331411 has 8 divisors (see below), whose sum is σ = 4547467264. Its totient is φ = 2261374920.
The previous prime is 3401331403. The next prime is 3401331419. The reversal of 3401331411 is 1141331043.
It is an interprime number because it is at equal distance from previous prime (3401331403) and next prime (3401331419).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3401331411 - 23 = 3401331403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3401331419) 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, 1543555 + ... + 1545756.
It is an arithmetic number, because the mean of its divisors is an integer number (568433408).
Almost surely, 23401331411 is an apocalyptic number.
3401331411 is a deficient number, since it is larger than the sum of its proper divisors (1146135853).
3401331411 is a wasteful number, since it uses less digits than its factorization.
3401331411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3089681.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 3401331411 is about 58320.9345861330. The cubic root of 3401331411 is about 1503.8908485830.
Adding to 3401331411 its reverse (1141331043), we get a palindrome (4542662454).
The spelling of 3401331411 in words is "three billion, four hundred one million, three hundred thirty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •