Search a number
-
+
4340246500601 = 11394567863691
BaseRepresentation
bin111111001010001010110…
…110011101010011111001
3120100220221020111210102122
4333022022312131103321
51032102311101004401
613121514241211025
7625400232355064
oct77121266352371
916326836453378
104340246500601
111423762aaa510
125a1203930a75
1325638ba9552b
141100d76978db
1577d76ae321b
hex3f28ad9d4f9

4340246500601 has 4 divisors (see below), whose sum is σ = 4734814364304. Its totient is φ = 3945678636900.

The previous prime is 4340246500573. The next prime is 4340246500621. The reversal of 4340246500601 is 1060056420434.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 4340246500601 - 222 = 4340242306297 is a prime.

It is a super-2 number, since 2×43402465006012 (a number of 26 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (4340246500621) 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, 197283931835 + ... + 197283931856.

It is an arithmetic number, because the mean of its divisors is an integer number (1183703591076).

Almost surely, 24340246500601 is an apocalyptic number.

It is an amenable number.

4340246500601 is a deficient number, since it is larger than the sum of its proper divisors (394567863703).

4340246500601 is a wasteful number, since it uses less digits than its factorization.

4340246500601 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 394567863702.

The product of its (nonzero) digits is 69120, while the sum is 35.

The spelling of 4340246500601 in words is "four trillion, three hundred forty billion, two hundred forty-six million, five hundred thousand, six hundred one".

Divisors: 1 11 394567863691 4340246500601