Base | Representation |
---|---|
bin | 111101100000110100001… |
… | …011111111000101000101 |
3 | 112222002221111101200010211 |
4 | 331200310023333011011 |
5 | 1023224122041021303 |
6 | 12553525204115421 |
7 | 614254025566315 |
oct | 75406413770505 |
9 | 15862844350124 |
10 | 4227123376453 |
11 | 138a792a43a6a |
12 | 5832b3095b71 |
13 | 248801535193 |
14 | 1088457bb445 |
15 | 74e5573566d |
hex | 3d8342ff145 |
4227123376453 has 2 divisors, whose sum is σ = 4227123376454. Its totient is φ = 4227123376452.
The previous prime is 4227123376409. The next prime is 4227123376459. The reversal of 4227123376453 is 3546733217224.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4224677381604 + 2445994849 = 2055402^2 + 49457^2 .
It is a cyclic number.
It is not a de Polignac number, because 4227123376453 - 237 = 4089684422981 is a prime.
It is a super-2 number, since 2×42271233764532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4227123376397 and 4227123376406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4227123376459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2113561688226 + 2113561688227.
It is an arithmetic number, because the mean of its divisors is an integer number (2113561688227).
Almost surely, 24227123376453 is an apocalyptic number.
It is an amenable number.
4227123376453 is a deficient number, since it is larger than the sum of its proper divisors (1).
4227123376453 is an equidigital number, since it uses as much as digits as its factorization.
4227123376453 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5080320, while the sum is 49.
The spelling of 4227123376453 in words is "four trillion, two hundred twenty-seven billion, one hundred twenty-three million, three hundred seventy-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •