Base | Representation |
---|---|
bin | 111101100110011010001… |
… | …111000000001011011001 |
3 | 112222200110010200122000012 |
4 | 331212122033000023121 |
5 | 1023323422341120323 |
6 | 13000401231451305 |
7 | 614555626542611 |
oct | 75463217001331 |
9 | 15880403618005 |
10 | 4233130410713 |
11 | 1392295839796 |
12 | 5844aa986b35 |
13 | 24924abc4919 |
14 | 108c554dba41 |
15 | 751a7cac678 |
hex | 3d99a3c02d9 |
4233130410713 has 2 divisors, whose sum is σ = 4233130410714. Its totient is φ = 4233130410712.
The previous prime is 4233130410661. The next prime is 4233130410779. The reversal of 4233130410713 is 3170140313324.
4233130410713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4153884219664 + 79246191049 = 2038108^2 + 281507^2 .
It is a cyclic number.
It is not a de Polignac number, because 4233130410713 - 222 = 4233126216409 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4233130410713.
It is not a weakly prime, because it can be changed into another prime (4233130410013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2116565205356 + 2116565205357.
It is an arithmetic number, because the mean of its divisors is an integer number (2116565205357).
Almost surely, 24233130410713 is an apocalyptic number.
It is an amenable number.
4233130410713 is a deficient number, since it is larger than the sum of its proper divisors (1).
4233130410713 is an equidigital number, since it uses as much as digits as its factorization.
4233130410713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 32.
The spelling of 4233130410713 in words is "four trillion, two hundred thirty-three billion, one hundred thirty million, four hundred ten thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •