Base | Representation |
---|---|
bin | 10100101101101010101… |
… | …100111010110110011101 |
3 | 12001002002220000022121111 |
4 | 110231222230322312131 |
5 | 141310133112212021 |
6 | 3005525003302021 |
7 | 204560532134455 |
oct | 24555254726635 |
9 | 5032086008544 |
10 | 1423424335261 |
11 | 4a9741a24055 |
12 | 1aba51b1a911 |
13 | a42c7878096 |
14 | 4cc735d4d65 |
15 | 2705e83d8e1 |
hex | 14b6ab3ad9d |
1423424335261 has 2 divisors, whose sum is σ = 1423424335262. Its totient is φ = 1423424335260.
The previous prime is 1423424335219. The next prime is 1423424335303. The reversal of 1423424335261 is 1625334243241.
It is a balanced prime because it is at equal distance from previous prime (1423424335219) and next prime (1423424335303).
It can be written as a sum of positive squares in only one way, i.e., 1164821574361 + 258602760900 = 1079269^2 + 508530^2 .
It is a cyclic number.
It is not a de Polignac number, because 1423424335261 - 219 = 1423423810973 is a prime.
It is a super-2 number, since 2×14234243352612 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1423424335211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 711712167630 + 711712167631.
It is an arithmetic number, because the mean of its divisors is an integer number (711712167631).
Almost surely, 21423424335261 is an apocalyptic number.
It is an amenable number.
1423424335261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1423424335261 is an equidigital number, since it uses as much as digits as its factorization.
1423424335261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 414720, while the sum is 40.
The spelling of 1423424335261 in words is "one trillion, four hundred twenty-three billion, four hundred twenty-four million, three hundred thirty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •