Base | Representation |
---|---|
bin | 111101100111111101000… |
… | …101010110011111100101 |
3 | 112222211201201021210210211 |
4 | 331213331011112133211 |
5 | 1023340321414400221 |
6 | 13001233553215421 |
7 | 614645005044064 |
oct | 75477505263745 |
9 | 15884651253724 |
10 | 4234788825061 |
11 | 1392a66988a63 |
12 | 584892261571 |
13 | 2494536709a2 |
14 | 108d7187a1db |
15 | 752536996e1 |
hex | 3d9fd1567e5 |
4234788825061 has 6 divisors (see below), whose sum is σ = 4375801565286. Its totient is φ = 4098182733000.
The previous prime is 4234788825037. The next prime is 4234788825077. The reversal of 4234788825061 is 1605288874324.
It can be written as a sum of positive squares in only one way, i.e., 2475213104961 + 1759575720100 = 1573281^2 + 1326490^2 .
It is not a de Polignac number, because 4234788825061 - 227 = 4234654607333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4234788824987 and 4234788825005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4234788825461) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2203323090 + ... + 2203325011.
It is an arithmetic number, because the mean of its divisors is an integer number (729300260881).
Almost surely, 24234788825061 is an apocalyptic number.
It is an amenable number.
4234788825061 is a deficient number, since it is larger than the sum of its proper divisors (141012740225).
4234788825061 is an equidigital number, since it uses as much as digits as its factorization.
4234788825061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4406648163 (or 4406648132 counting only the distinct ones).
The product of its (nonzero) digits is 20643840, while the sum is 58.
The spelling of 4234788825061 in words is "four trillion, two hundred thirty-four billion, seven hundred eighty-eight million, eight hundred twenty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •