Base | Representation |
---|---|
bin | 111000010111001101100… |
… | …011111000001010011001 |
3 | 111201021102221222012011102 |
4 | 320113031203320022121 |
5 | 1001424320323034212 |
6 | 12123155143441145 |
7 | 546554601032501 |
oct | 70271543701231 |
9 | 14637387865142 |
10 | 3873214268057 |
11 | 1263691530722 |
12 | 5267a37561b5 |
13 | 22131cb19b84 |
14 | d5670ad4a01 |
15 | 6ab404125c2 |
hex | 385cd8f8299 |
3873214268057 has 2 divisors, whose sum is σ = 3873214268058. Its totient is φ = 3873214268056.
The previous prime is 3873214268047. The next prime is 3873214268107. The reversal of 3873214268057 is 7508624123783.
3873214268057 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., 3793628780176 + 79585487881 = 1947724^2 + 282109^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3873214268057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3873214267993 and 3873214268011.
It is not a weakly prime, because it can be changed into another prime (3873214268047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1936607134028 + 1936607134029.
It is an arithmetic number, because the mean of its divisors is an integer number (1936607134029).
Almost surely, 23873214268057 is an apocalyptic number.
It is an amenable number.
3873214268057 is a deficient number, since it is larger than the sum of its proper divisors (1).
3873214268057 is an equidigital number, since it uses as much as digits as its factorization.
3873214268057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13547520, while the sum is 56.
The spelling of 3873214268057 in words is "three trillion, eight hundred seventy-three billion, two hundred fourteen million, two hundred sixty-eight thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •