Base | Representation |
---|---|
bin | 111111001010010100000… |
… | …001001100011100011001 |
3 | 120100221022221221010022120 |
4 | 333022110001030130121 |
5 | 1032103114434410131 |
6 | 13121541414011453 |
7 | 625404110622105 |
oct | 77122401143431 |
9 | 16327287833276 |
10 | 4340400310041 |
11 | 1423831903854 |
12 | 5a1247346b89 |
13 | 2563b48c9333 |
14 | 11010dc94905 |
15 | 77d85376496 |
hex | 3f29404c719 |
4340400310041 has 8 divisors (see below), whose sum is σ = 5794098152640. Its totient is φ = 2890151337072.
The previous prime is 4340400310021. The next prime is 4340400310091. The reversal of 4340400310041 is 1400130040434.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4340400310041 - 26 = 4340400309977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4340400309993 and 4340400310020.
It is not an unprimeable number, because it can be changed into a prime (4340400310021) 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, 862214470 + ... + 862219503.
It is an arithmetic number, because the mean of its divisors is an integer number (724262269080).
Almost surely, 24340400310041 is an apocalyptic number.
It is an amenable number.
4340400310041 is a deficient number, since it is larger than the sum of its proper divisors (1453697842599).
4340400310041 is a wasteful number, since it uses less digits than its factorization.
4340400310041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1724434815.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 4340400310041 its reverse (1400130040434), we get a palindrome (5740530350475).
The spelling of 4340400310041 in words is "four trillion, three hundred forty billion, four hundred million, three hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •