Base | Representation |
---|---|
bin | 111111001100000000000… |
… | …100001001011010110101 |
3 | 120101010000021212111120212 |
4 | 333030000010021122311 |
5 | 1032120323013222123 |
6 | 13122441330435205 |
7 | 625500041466536 |
oct | 77140004113265 |
9 | 16333007774525 |
10 | 4342213023413 |
11 | 1424582061181 |
12 | 5a1672432b05 |
13 | 25661331acb5 |
14 | 11024291a68d |
15 | 77e3e591878 |
hex | 3f3001096b5 |
4342213023413 has 8 divisors (see below), whose sum is σ = 4354868482080. Its totient is φ = 4329563873040.
The previous prime is 4342213023377. The next prime is 4342213023433. The reversal of 4342213023413 is 3143203122434.
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 4342213023413 - 232 = 4337918056117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4342213023413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4342213023433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 196643 + ... + 2953488.
It is an arithmetic number, because the mean of its divisors is an integer number (544358560260).
Almost surely, 24342213023413 is an apocalyptic number.
It is an amenable number.
4342213023413 is a deficient number, since it is larger than the sum of its proper divisors (12655458667).
4342213023413 is a wasteful number, since it uses less digits than its factorization.
4342213023413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3154147.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 4342213023413 its reverse (3143203122434), we get a palindrome (7485416145847).
The spelling of 4342213023413 in words is "four trillion, three hundred forty-two billion, two hundred thirteen million, twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •