Base | Representation |
---|---|
bin | 1111110001100011… |
… | …0100110001101101 |
3 | 101221002201002020122 |
4 | 3330120310301231 |
5 | 32132444203221 |
6 | 1540101054325 |
7 | 206634342362 |
oct | 37430646155 |
9 | 11832632218 |
10 | 4234366061 |
11 | 1883209992 |
12 | 9a20b73a5 |
13 | 52634c063 |
14 | 2c2520469 |
15 | 19bb1beab |
hex | fc634c6d |
4234366061 has 4 divisors (see below), whose sum is σ = 4337643324. Its totient is φ = 4131088800.
The previous prime is 4234366051. The next prime is 4234366063. The reversal of 4234366061 is 1606634324.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 754545961 + 3479820100 = 27469^2 + 58990^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4234366061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4234366063) 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, 51638570 + ... + 51638651.
It is an arithmetic number, because the mean of its divisors is an integer number (1084410831).
Almost surely, 24234366061 is an apocalyptic number.
4234366061 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
4234366061 is a deficient number, since it is larger than the sum of its proper divisors (103277263).
4234366061 is a wasteful number, since it uses less digits than its factorization.
4234366061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103277262.
The product of its (nonzero) digits is 62208, while the sum is 35.
The square root of 4234366061 is about 65072.0067386891. The cubic root of 4234366061 is about 1617.8172683046.
The spelling of 4234366061 in words is "four billion, two hundred thirty-four million, three hundred sixty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •